array_map.h [code] | Graph maps that construates and destruates their elements dynamically |
bfs.h [code] | Bfs algorithm |
bin_heap.h [code] | Binary Heap implementation |
default_map.h [code] | Graph maps that construates and destruates their elements dynamically |
dfs.h [code] | DFS algorithm |
dijkstra.h [code] | Dijkstra algorithm |
dimacs.h [code] | Dimacs file format reader |
extended_pair.h [code] | |
fib_heap.h [code] | Fibonacci Heap implementation |
full_graph.h [code] | FullGraph and SymFullGraph classes |
graph.h [code] | Declaration of Graph |
graph_wrapper.h [code] | Several graph wrappers |
invalid.h [code] | Definition of INVALID |
kruskal.h [code] | Kruskal's algorithm to compute a minimum cost tree |
list_graph.h [code] | ListGraph, SymListGraph, NodeSet and EdgeSet classes |
map_bits.h [code] | Some utils to help implement maps |
map_defines.h [code] | Defines to help creating graph maps |
map_iterator.h [code] | Iterators on the maps |
map_registry.h [code] | Map registry for graph maps |
maps.h [code] | Miscellaneous property maps |
skeletons/maps.h [code] | Map concepts checking classes for testing and documenting |
min_cost_flow.h [code] | An algorithm for finding a flow of value k (for small values of k ) having minimal total cost |
path.h [code] | Classes for representing paths in graphs |
skeletons/path.h [code] | Classes for representing paths in graphs |
preflow.h [code] | |
smart_graph.h [code] | SmartGraph and SymSmartGraph classes |
suurballe.h [code] | An algorithm for finding k paths of minimal total length |
sym_map.h [code] | Graph maps that construates and destruates their elements dynamically |
template.h [code] | |
test_tools.h [code] | Some utility to write test programs |
time_measure.h [code] | Tools for measuring cpu usage |
unionfind.h [code] | Union-Find data structures |
vector_map.h [code] | Vector based graph maps |
xy.h [code] | A simple two dimensional vector and a bounding box implementation |