Next:
Helper Types for Flexibly
Up:
The LEDA User Manual
Previous:
Graph Drawing Algorithms (graph_draw)
Graphs and Iterators
Helper Types for Flexibly Adaptable Graph Algorithms
Iterators
Data Accessors
Graphiterator Algorithms
Node Iterators (NodeIt)
Edge Iterators (EdgeIt)
Adjacency Iterators for leaving edges (OutAdjIt)
Adjacency Iterators for incoming edges (InAdjIt)
Adjacency Iterators (AdjIt)
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
1998-07-07
