![]()  | 
  
    AuD
    
   Lecture 'Algorithmen und Datenstrukturen' (code examples) 
   | 
 
Defines iterator over all edges of anlink AbstractGraph}. More...
 Inheritance diagram for aud.graph.AbstractGraph< Node extends AbstractNode, Edge extends AbstractEdge >.Edges:
 Collaboration diagram for aud.graph.AbstractGraph< Node extends AbstractNode, Edge extends AbstractEdge >.Edges:Public Member Functions | |
| Iterator< Edge > | iterator () | 
Defines iterator over all edges of anlink AbstractGraph}.
Definition at line 191 of file AbstractGraph.java.
| Iterator< Edge > aud.graph.AbstractGraph< Node extends AbstractNode, Edge extends AbstractEdge >.Edges.iterator | ( | ) | 
Definition at line 194 of file AbstractGraph.java.
References aud.graph.AbstractGraph< Node extends AbstractNode, Edge extends AbstractEdge >.getEdgeIterator().
 Here is the call graph for this function: