GTL - Graph Template Library Class List

Here are the classes, structs, unions and interfaces with brief descriptions:
algorithmAbstract baseclass for all algoritm-classes
bellman_fordBellman Ford algorithm
bfsBreadth-First-Search (BFS) algorithm
biconnectivityBiconnectivity-test and low-numbers
bid_dijkstraDijkstra's Algorithm for computing a shortest path from a single source to a single target
bin_heap< T, Pred >Binary heap
componentsConnected components algorithm
dfsDepth-First-Search (DFS) algorithm
dijkstraDijkstra's Algorithm for computing single source shortest path
edgeAn edge in a graph
edge_map< T, Alloc >A specialized map with edges as keys
fm_partitionHeuristic graph bi-partitioning algorithm (Fiduccia-Mattheyses)
GML_errorReason and position of an error in a GML file
graphA directed or undirected graph
maxflow_ffMaximum flow algorithm (Edmonds-Karp)
maxflow_ppMaximum flow algorithm (Malhotra, Kumar, Maheshwari)
maxflow_sapMaximum flow algorithm with shortest augmenting paths
min_treeKruskal's algorithm for finding minimal spanning tree of a graph
ne_map< Key, Value, Graph, Alloc >Baseclass for node_map and edge_map
nodeA node in a graph
node_map< T, Alloc >A specialized map with nodes as keys
planar_embeddingOrdered adjacency lists as a result of planarity testing
planarityTests if a graph can be drawn on a plane without any edge crossings
pq_treePQ-Trees
ratio_cut_partitionHeuristic graph bi-partitioning algorithm (Wei-Cheng)
st_numberST-number algorithm
symlist< T >List which can be reversed in $\mathcal{O}(1)$
topsortTopological sorting