|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectuk.ed.inf.graph.impl.Subgraph
public final class Subgraph
Constructor Summary | |
---|---|
Subgraph(Graph superGraph)
|
Method Summary | |
---|---|
(package private) void |
addConnectedEdge(Edge edge)
|
(package private) void |
addDanglingEdge(Edge edge)
|
(package private) void |
addNode(Node node)
|
boolean |
containsConnection(IBasicPair<? extends Node,? extends Edge> ends)
Tests if the graph has an edge between the defined ends. |
boolean |
containsConnection(Node thisNode,
Node thatNode)
Tests if the graph contains an edge connecting these nodes. |
boolean |
containsEdge(Edge edge)
Tests if the graph contains the edge. |
boolean |
containsEdge(int edgeIdx)
Tests if the graph contains the edge of the given index. |
boolean |
containsNode(int nodeIdx)
Tests if the graph contains the node with the given index number. |
boolean |
containsNode(Node node)
Tests if this node exists in the graph. |
java.util.Iterator<Edge> |
edgeIterator()
Get an iterator that traverses all the edges in this graph. |
Edge |
getEdge(int edgeIdx)
Get the edge with this index. |
Node |
getNode(int nodeIdx)
Get the node matching the nodeIdx. |
int |
getNumEdges()
Get the number of edges in the graph. |
int |
getNumNodes()
Get the number of nodes in the graph. |
Graph |
getSuperGraph()
|
boolean |
isConsistentSnapShot()
|
boolean |
isInducedSubgraph()
|
java.util.Iterator<Node> |
nodeIterator()
Get an iterator that traverses all the nodes in this graph. |
Methods inherited from class java.lang.Object |
---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Constructor Detail |
---|
Subgraph(Graph superGraph)
Method Detail |
---|
public boolean isInducedSubgraph()
isInducedSubgraph
in interface IBasicSubgraph<Node,Edge>
public Graph getSuperGraph()
getSuperGraph
in interface IBasicSubgraph<Node,Edge>
public boolean containsNode(Node node)
IBasicGraph
containsNode
in interface IBasicGraph<Node,Edge>
node
- to be tested.
public boolean containsConnection(Node thisNode, Node thatNode)
IBasicGraph
containsConnection
in interface IBasicGraph<Node,Edge>
thisNode
- a node to test.thatNode
- the other node to test.
public boolean containsEdge(Edge edge)
IBasicGraph
containsEdge
in interface IBasicGraph<Node,Edge>
edge
- the edge to test.
public java.util.Iterator<Edge> edgeIterator()
IBasicGraph
edgeIterator
in interface IBasicGraph<Node,Edge>
public java.util.Iterator<Node> nodeIterator()
IBasicGraph
nodeIterator
in interface IBasicGraph<Node,Edge>
public int getNumEdges()
IBasicGraph
getNumEdges
in interface IBasicGraph<Node,Edge>
public int getNumNodes()
IBasicGraph
getNumNodes
in interface IBasicGraph<Node,Edge>
void addNode(Node node)
void addConnectedEdge(Edge edge)
void addDanglingEdge(Edge edge)
public boolean containsEdge(int edgeIdx)
IBasicGraph
containsEdge
in interface IBasicGraph<Node,Edge>
edgeIdx
- the index to test.
public boolean containsNode(int nodeIdx)
IBasicGraph
containsNode
in interface IBasicGraph<Node,Edge>
nodeIdx
- The index number of the node.
public Edge getEdge(int edgeIdx)
IBasicGraph
getEdge
in interface IBasicGraph<Node,Edge>
edgeIdx
- The index of the edge.
public Node getNode(int nodeIdx)
IBasicGraph
getNode
in interface IBasicGraph<Node,Edge>
nodeIdx
- the node index to lookup.
public boolean isConsistentSnapShot()
isConsistentSnapShot
in interface IBasicSubgraph<Node,Edge>
public boolean containsConnection(IBasicPair<? extends Node,? extends Edge> ends)
IBasicGraph
containsConnection
in interface IBasicGraph<Node,Edge>
ends
- the ends of the edge to test.
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |