|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||
public interface Graph
| Nested Class Summary | |
|---|---|
static class |
Graph.NoEdgeException
This class is thrown by getEdgeLength(node1, node2) if node1 and node2 are not directly connected by an edge. |
static class |
Graph.Utils
|
| Method Summary | |
|---|---|
List<Node> |
getAdjacencies(Node node)
Returns a list of nodes connected to this node by an edge |
Edge |
getEdge(Node node1,
Node node2)
Returns the Edge that connects these two nodes |
double |
getEdgeLength(Node node1,
Node node2)
Returns the length of the edge that connects these two nodes |
Set<Edge> |
getEdges()
|
List<Edge> |
getEdges(Node node)
Returns a list of edges connected to this node |
Set<Node> |
getNodes()
|
Node[] |
getNodes(Edge edge)
Returns an array of 2 nodes which are the nodes at either end of the edge. |
Set<Node> |
getNodes(int degree)
|
| Methods inherited from interface jebl.util.Attributable |
|---|
getAttribute, getAttributeMap, getAttributeNames, removeAttribute, setAttribute |
| Method Detail |
|---|
List<Edge> getEdges(Node node)
node -
List<Node> getAdjacencies(Node node)
node -
Edge getEdge(Node node1,
Node node2)
throws Graph.NoEdgeException
node1 - node2 -
Graph.NoEdgeException - if the nodes are not directly connected by an edge.
double getEdgeLength(Node node1,
Node node2)
throws Graph.NoEdgeException
node1 - node2 -
Graph.NoEdgeException - if the nodes are not directly connected by an edge.Node[] getNodes(Edge edge)
edge -
Set<Node> getNodes()
Set<Edge> getEdges()
Set<Node> getNodes(int degree)
degree - the number of edges connected to a node
|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||