Next:
Introduction
Up:
The LEDA User Manual
Previous:
Graph Drawing Algorithms (
Contents
Index
Graphs and Iterators
Subsections
Introduction
Iterators
Handles and Iterators
STL Iterators
Circulators
Data Accessors
Graphiterator Algorithms
Node Iterators ( NodeIt )
Edge Iterators ( EdgeIt )
Face Iterators ( FaceIt )
Adjacency Iterators for leaving edges ( OutAdjIt )
Adjacency Iterators for incoming edges ( InAdjIt )
Adjacency Iterators ( AdjIt )
Face Circulators ( FaceCirc )
Filter Node Iterator ( FilterNodeIt )
Comparison Predicate ( CompPred )
Observer Node Iterator ( ObserverNodeIt )
STL Iterator Wrapper ( STLNodeIt )
Node Array Data Accessor ( node_array_da )
Constant Accessors ( constant_da )
Node Member Accessors ( node_member_da )
Node Attribute Accessors ( node_attribute_da )
Breadth First Search (flexible) ( GIT_BFS )
Depth First Search (flexible) ( GIT_DFS )
Topological Sort (flexible) ( GIT_TOPOSORT )
Strongly Connected Components (flexible) ( GIT_SCC )
Dijkstra(flexible) ( GIT_DIJKSTRA )
LEDA research project
2000-02-09
