|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use Node | |
---|---|
uk.ed.inf.graph.impl |
Uses of Node in uk.ed.inf.graph.impl |
---|
Methods in uk.ed.inf.graph.impl that return Node | |
---|---|
Node |
NodeFactory.createNode()
|
Node |
Subgraph.getNode(int nodeIdx)
|
Node |
Graph.getNode(int index)
|
Node |
NodePair.getOneNode()
|
Node |
NodePair.getOtherNode(Node node)
Get the other node of the pair to this one. |
Node |
NodePair.getTwoNode()
|
Methods in uk.ed.inf.graph.impl that return types with arguments of type Node | |
---|---|
java.util.Iterator<Node> |
Node.connectedNodeIterator()
|
IBasicPair<Node,Edge> |
EdgeFactory.getCurrentNodePair()
|
IGraphState<Node,Edge> |
Graph.getCurrentState()
|
IBasicGraph<Node,Edge> |
NodeFactory.getGraph()
|
IBasicGraph<Node,Edge> |
EdgeFactory.getGraph()
|
java.util.Iterator<Node> |
SubgraphFactory.nodeIterator()
|
java.util.Iterator<Node> |
Subgraph.nodeIterator()
|
java.util.Iterator<Node> |
Graph.nodeIterator()
|
Methods in uk.ed.inf.graph.impl with parameters of type Node | |
---|---|
(package private) void |
Graph.addNewNode(Node newNode)
|
void |
SubgraphFactory.addNode(Node node)
|
(package private) void |
Subgraph.addNode(Node node)
|
int |
Node.compareTo(Node o)
|
boolean |
Subgraph.containsConnection(Node thisNode,
Node thatNode)
|
boolean |
Graph.containsConnection(Node thisNode,
Node thatNode)
|
boolean |
Subgraph.containsNode(Node node)
|
boolean |
NodePair.containsNode(Node node)
|
boolean |
Graph.containsNode(Node node)
|
java.util.SortedSet<Edge> |
Node.getEdgesWith(Node other)
|
Node |
NodePair.getOtherNode(Node node)
Get the other node of the pair to this one. |
boolean |
Node.hasEdgeWith(Node other)
|
boolean |
NodePair.hasEnds(Node endOne,
Node endTwo)
|
boolean |
EdgeFactory.isValidNodePair(Node thisNode,
Node thatNode)
|
void |
EdgeFactory.setPair(Node oneNode,
Node twoNode)
|
Method parameters in uk.ed.inf.graph.impl with type arguments of type Node | |
---|---|
boolean |
Graph.canCopyHere(IBasicSubgraph<? extends Node,? extends Edge> subGraph)
|
boolean |
Subgraph.containsConnection(IBasicPair<? extends Node,? extends Edge> ends)
|
boolean |
Graph.containsConnection(IBasicPair<? extends Node,? extends Edge> ends)
|
void |
Graph.copyHere(IBasicSubgraph<? extends Node,? extends Edge> subGraph)
|
boolean |
Edge.hasEnds(IBasicPair<? super Node,? super Edge> ends)
|
void |
Graph.removeSubgraph(IBasicSubgraph<? extends Node,? extends Edge> subgraph)
|
void |
Graph.restoreState(IGraphState<Node,Edge> previousState)
|
Constructors in uk.ed.inf.graph.impl with parameters of type Node | |
---|---|
Edge(Graph graph,
int index,
Node oneNode,
Node twoNode)
|
|
NodePair(Node oneNode,
Node twoNode)
|
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |