ArrayMap | |
Bfs | BFS algorithm class |
BidirGraph | A bidirected graph template |
BidirGraphWrapper | A wrapper for composing bidirected graph from a directed one |
BinHeap | A Binary Heap implementation |
BoundingBox | A class to calculate or store the bounding box of plainvectors |
ConstMap | Constant map |
Dfs | DFS algorithm class |
Dijkstra | Dijkstra algorithm class |
DirPath | A structure for representing directed paths in a graph |
DirPath::Builder | Class to build paths |
DirPath::EdgeIt | Iterator class to iterate on the edges of the paths |
DirPath::NodeIt | Iterator class to iterate on the nodes of the paths |
EdgeSet | Graph structure using a node set of another graph |
ErasableGraph | An empty erasable graph class |
ErasingFirstGraphWrapper | For blocking flows |
ExtendableGraph | An empty non-static graph class |
FibHeap | Fibonacci Heap |
FullGraph | A full graph class |
GraphWrapper | Base type for the Graph Wrappers |
Invalid | See INVALID, how to use it |
KeyInfo | Helper class to get information about the key type |
KruskalMapInput | Kruskal input source |
KruskalSequenceOutput | A writable bool-map that makes a sequence of "true" keys |
ListGraph | A list graph class |
MapBase | Base class of maps |
MapConstIterator | |
MapConstIterator::PairPointerType | The pointer type of the iterator |
MapConstKeySet | |
MapConstValueIterator | |
MapConstValueSet | |
MapIterator | |
MapIterator::PairPointerType | The pointer type of the iterator |
MapIteratorBase | |
MapKeyIterator | |
MapRegistry | |
MapRegistry::MapBase | |
MapRegistry::MapBase::NotSupportedOperationException | |
MapValueIterator | |
MapValueSet | |
MinCostFlow | Implementation of an algorithm for finding a flow of value k (for small values of k ) having minimal total cost between 2 nodes |
NodeSet | A graph class containing only nodes |
NodeSet::EdgeMap | Creating empty map structure for edges |
NonConstMapWr | Helper class for calling kruskal with "constant" output map |
NullMap | Null map. (a.k.a. DoNothingMap) |
Path | A skeletom structure for representing directed paths in a graph |
Path::Builder | Class to build paths |
Path::EdgeIt | Iterator class to iterate on the edges of the paths |
Path::NodeIt | Iterator class to iterate on the nodes of the paths |
PetStruct | Structure returned by addPetersen() |
Preflow | Preflow algorithms class |
ReadMap | Readable map concept |
ReadWriteMap | Read/Writable map concept |
ReferenceMap | Dereferable map concept |
ResGraphWrapper | A wrapper for composing the residual graph for directed flow and circulation problems |
ResGraphWrapper::ResCap | Residual capacity map |
RevGraphWrapper | A graph wrapper which reverses the orientation of the edges |
SmartGraph | A smart graph class |
StaticGraph | An empty static graph class |
StaticGraph::Edge | The base type of the edge iterators |
StaticGraph::EdgeIt | This iterator goes through each edge |
StaticGraph::EdgeMap | Reference map of the edges to type T |
StaticGraph::InEdgeIt | This iterator goes trough the incoming edges of a node |
StaticGraph::Node | Copy consructor |
StaticGraph::NodeIt | This iterator goes through each node |
StaticGraph::NodeMap | Reference map of the nodes to type T |
StaticGraph::OutEdgeIt | This iterator goes trough the outgoing edges of a node |
StdMap | std::map wrapper |
SubBidirGraphWrapper | A wrapper for composing a subgraph of a bidirected graph made from a directed one |
SubBidirGraphWrapper::Edge | |
SubBidirGraphWrapper::EdgeMap | |
SubGraphWrapper | A graph wrapper for hiding nodes and edges from a graph |
Suurballe | Implementation of an algorithm for finding k edge-disjoint paths between 2 nodes of minimal total length |
SymEdgeIt | |
SymListGraph | Graph for bidirectional edges |
SymMap | |
SymSmartGraph | Graph for bidirectional edges |
Timer | Class measuring the cpu time and real time usage of the process |
TimeStamp | A class to store (cpu)time instances |
UndirPath | A structure for representing undirected path in a graph |
UndirPath::Builder | Class to build paths |
UndirPath::EdgeIt | Iterator class to iterate on the edges of the paths |
UndirPath::NodeIt | Iterator class to iterate on the nodes of the paths |
UnionFind | A Union-Find data structure implementation |
UnionFindEnum | A Union-Find data structure implementation which is able to enumerate the components |
VectorMap | |
WriteMap | Writable map concept |
xy | A two dimensional vector (plainvector) implementation |