Home | Documentation | Download | Platforms | Projects | Mailing Lists | Version History
| algorithm | Abstract baseclass for all algoritm-classes |
| bellman_ford | Bellman Ford algorithm |
| bfs | Breadth-First-Search (BFS) algorithm |
| biconnectivity | Biconnectivity-test and low-numbers |
| bid_dijkstra | Dijkstra's Algorithm for computing a shortest path from a single source to a single target |
| bin_heap< T, Pred > | Binary heap |
| components | Connected components algorithm |
| dfs | Depth-First-Search (DFS) algorithm |
| dijkstra | Dijkstra's Algorithm for computing single source shortest path |
| edge | An edge in a graph |
| edge_map< T, Alloc > | A specialized map with edges as keys |
| fm_partition | Heuristic graph bi-partitioning algorithm (Fiduccia-Mattheyses) |
| GML_error | Reason and position of an error in a GML file |
| graph | A directed or undirected graph |
| maxflow_ff | Maximum flow algorithm (Edmonds-Karp) |
| maxflow_pp | Maximum flow algorithm (Malhotra, Kumar, Maheshwari) |
| maxflow_sap | Maximum flow algorithm with shortest augmenting paths |
| min_tree | Kruskal's algorithm for finding minimal spanning tree of a graph |
| ne_map< Key, Value, Graph, Alloc > | Baseclass for node_map and edge_map |
| node | A node in a graph |
| node_map< T, Alloc > | A specialized map with nodes as keys |
| planar_embedding | Ordered adjacency lists as a result of planarity testing |
| planarity | Tests if a graph can be drawn on a plane without any edge crossings |
| pq_tree | PQ-Trees |
| ratio_cut_partition | Heuristic graph bi-partitioning algorithm (Wei-Cheng) |
| st_number | ST-number algorithm |
| symlist< T > | List which can be reversed in |
| topsort | Topological sorting |
University of Passau - FMI - Theoretical Computer Science