|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
public interface Structure
Structures are generic objects which may contain nodes and edges.
Method Summary | ||
---|---|---|
|
getEachEdge()
Set of edges usable in a for-each instruction. |
|
|
getEachNode()
Set of nodes usable in a for-each instruction. |
|
int |
getEdgeCount()
Number of edges in this graph. |
|
|
getEdgeIterator()
Iterator on the set of edges, in an undefined order. |
|
|
getEdgeSet()
Unmodifiable view of the set of edges. |
|
int |
getNodeCount()
Number of nodes in this graph. |
|
|
getNodeIterator()
Iterator on the set of nodes, in an undefined order. |
|
|
getNodeSet()
Unmodifiable view of the set of nodes. |
Method Detail |
---|
int getNodeCount()
int getEdgeCount()
<T extends Node> Iterator<T> getNodeIterator()
Iterator<ExtendedNode> ite = graph.getNodeIterator();the method will return an Iterator<ExtendedNode>. If no left part exists, method will just return an Iterator<Node>.
<T extends Edge> Iterator<T> getEdgeIterator()
Iterator<ExtendedEdge> ite = graph.getEdgeIterator();the method will return an Iterator<ExtendedEdge>. If no left part exists, method will just return an Iterator<Edge>.
<T extends Node> Iterable<? extends T> getEachNode()
Iterable<ExtendedNode> ite = struct.getEachNode();the method will return an Iterable<ExtendedNode>. If no left part exists, method will just return an Iterable<Node>. It is possible to use it in a for-each loop by giving the parameter :
for (ExtendedNode n : struct.<ExtendedNode> getEachNode()) { // ... }
getNodeIterator()
,
getEachNode()
<T extends Edge> Iterable<? extends T> getEachEdge()
Iterable<ExtendedNEdge> ite = struct.getEachEdge();the method will return an Iterable<ExtendedEdge>. If no left part exists, method will just return an Iterable<Edge>. It is possible to use it in a for-each loop by giving the parameter :
for (ExtendedEdge e : struct.<ExtendedEdge> getEachEdge()) { // ... }
getEdgeIterator()
,
getEdgeSet()
<T extends Node> Collection<T> getNodeSet()
Collection<ExtendedNode> c = struct.getNodeSet();the method will return a Collection<ExtendedNode>. If no left part exists, method will just return a Collection<Node>.
getNodeIterator()
,
getEachNode()
<T extends Edge> Collection<T> getEdgeSet()
Collection<ExtendedEdge> c = struct.getEdgeSet();the method will return a Collection<ExtendedEdge>. If no left part exists, method will just return a Collection<Edge>.
getEdgeIterator()
,
getEachEdge()
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |