|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use Edge | |
---|---|
uk.ed.inf.graph.impl |
Uses of Edge in uk.ed.inf.graph.impl |
---|
Methods in uk.ed.inf.graph.impl that return Edge | |
---|---|
Edge |
EdgeFactory.createEdge()
|
Edge |
Subgraph.getEdge(int edgeIdx)
|
Edge |
Graph.getEdge(int edgeIdx)
|
Methods in uk.ed.inf.graph.impl that return types with arguments of type Edge | |
---|---|
java.util.Iterator<Edge> |
SubgraphFactory.edgeIterator()
|
java.util.Iterator<Edge> |
Subgraph.edgeIterator()
|
java.util.Iterator<Edge> |
Node.edgeIterator()
|
java.util.Iterator<Edge> |
Graph.edgeIterator()
|
IBasicPair<Node,Edge> |
EdgeFactory.getCurrentNodePair()
|
IGraphState<Node,Edge> |
Graph.getCurrentState()
|
java.util.SortedSet<Edge> |
Node.getEdgesWith(Node other)
|
IBasicGraph<Node,Edge> |
NodeFactory.getGraph()
|
IBasicGraph<Node,Edge> |
EdgeFactory.getGraph()
|
Methods in uk.ed.inf.graph.impl with parameters of type Edge | |
---|---|
(package private) void |
Subgraph.addConnectedEdge(Edge edge)
|
(package private) void |
Subgraph.addDanglingEdge(Edge edge)
|
void |
SubgraphFactory.addEdge(Edge edge)
|
(package private) void |
Node.addEdge(Edge edge)
|
int |
Edge.compareTo(Edge o)
|
boolean |
Subgraph.containsEdge(Edge edge)
|
boolean |
Graph.containsEdge(Edge edge)
|
Method parameters in uk.ed.inf.graph.impl with type arguments of type Edge | |
---|---|
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)
|
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |