AuD
Lecture 'Algorithmen und Datenstrukturen' (code examples)
aud.graph.AbstractGraph< Node extends AbstractNode, Edge extends AbstractEdge >.Edges Class Reference

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 ()
 

Detailed Description

Defines iterator over all edges of anlink AbstractGraph}.

See also
AbstractGraph::edges

Definition at line 191 of file AbstractGraph.java.

Member Function Documentation

◆ iterator()

Iterator< Edge > aud.graph.AbstractGraph< Node extends AbstractNode, Edge extends AbstractEdge >.Edges.iterator ( )

Definition at line 194 of file AbstractGraph.java.

194 {
195 return (Iterator<Edge>) graph_.getEdgeIterator();
196 }
abstract Iterator< Edge > getEdgeIterator()
Get iterator over all edges.

References aud.graph.AbstractGraph< Node extends AbstractNode, Edge extends AbstractEdge >.getEdgeIterator().

+ Here is the call graph for this function:

The documentation for this class was generated from the following file: