_ErasableGraph | Modular builded erasable graph class |
_ExtendableGraph | Modular builded extendable graph class |
_StaticGraph | Modular builded static graph class |
AbsMap | Absolute value of a map |
AddMap | Sum of two maps |
AlterableGraphComponent | An empty alteration notifier base graph class |
AlterableGraphExtender | Class to extend a graph with the functionality of alteration observing |
AlterableUndirGraphExtender | Class to extend an undirected graph with the functionality of alteration observing |
AlterationNotifier | Registry class to register objects observes alterations in the graph |
AlterationNotifier::ObserverBase | ObserverBase is the base class for the observers |
ArrayMap | |
AssertionFailedError | |
BaseErasableGraphComponent | An empty erasable base graph class |
BaseExtendableGraphComponent | An empty extendable base graph class |
BaseGraphComponent | An empty base graph class |
BaseIterableGraphComponent | An empty iterable base graph class |
Bfs | BFS algorithm class |
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 |
ClearableGraphComponent | An empty clearable base graph class |
Color | Data structure representing RGB colors |
ComposeMap | Composition of two maps |
ConstMap | Constant map |
DataFormatError | |
DefaultGraphToEpsTraits | Default traits class of GraphToEps |
DefaultMapSelector | |
DefaultReaderTraits | Standard ReaderTraits for the GraphReader class |
DefaultReaderTraits::Reader | Template class for reading an value |
DefaultWriterTraits | Standard WriterTraits for the GraphWriter class |
DefaultWriterTraits::Writer | Template class for writing an value |
DescriptorMap | Provides a mutable, continous and unique descriptor for each item in the graph |
Dfs | DFS algorithm class |
Dijkstra | Dijkstra algorithm class |
Dijkstra::DefDistMap | Named parameter for setting DistMap type |
Dijkstra::DefPredMap | Named parameter for setting PredMap type |
Dijkstra::DefPredNodeMap | Named parameter for setting PredNodeMap type |
Dijkstra::DefReachedMap | Named parameter for setting ReachedMap type |
Dijkstra::DefReachedMapToBeDefaultMap | Named parameter for setting the ReachedMap type to be Graph::NodeMap<bool> |
Dijkstra::UninitializedParameter | Exception for uninitialized parameters |
DijkstraDefaultTraits | Default traits class of Dijkstra class |
DijkstraWizard | A class to make easier the usage of Dijkstra algorithm |
DijkstraWizardBase | Default traits used by DijkstraWizard |
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 |
DivMap | Quotient of two maps |
EdgeSubGraphWrapper | A wrapper for hiding edges from a graph |
ErasableGraph | An empty erasable graph class |
ErasableGraphComponent | An empty erasable extended graph class |
ErasableSymGraph | An empty erasable graph class |
ErasingFirstGraphWrapper | For blocking flows |
ErrorMessage | Exception-safe convenient "error message" class |
Exception | Generic exception class |
ExtendableGraph | An empty non-static graph class |
ExtendableGraphComponent | An empty extendable extended graph class |
ExtendableSymGraph | An empty non-static graph class |
False | Basic type for defining "tags". A "NO" condidion for enable_if |
FibHeap | Fibonacci Heap |
FullGraph | A full graph class |
FunctorMap | Converts an STL style functor to a a map |
GraphIncIterator | Skeleton class for graph InEdgeIt and OutEdgeIt |
GraphItem | Skeleton class for graph Node and Edge types |
GraphIterator | Skeleton class for graph NodeIt and EdgeIt |
GraphMap | Class describing the concept of graph maps |
GraphReader | The graph reader class |
GraphToEps | Helper class to implement the named parameters of graphToEps() |
GraphWriter | The graph writer class |
IDableGraphComponent | An empty idable base graph class |
IdMap | Provides an immutable and unique id for each item in the graph |
IdMap::InverseMap | The class represents the inverse of the map |
Invalid | See INVALID, how to use it |
InversableMap | General inversable map type |
IOError | |
IterableGraphComponent | An empty iterable base graph class |
KruskalMapInput | Kruskal input source |
KruskalSequenceOutput | A writable bool-map that makes a sequence of "true" keys |
ListGraph | A list graph class |
ListGraph::SnapShot | Class to make a snapshot of the graph and to restrore to it later |
LogicError | One of the two main subclasses of Exception |
MapBase | Base class of maps |
MapConstIterator | |
MapConstIterator::PairPointer | The pointer type of the iterator |
MapConstKeySet | |
MapConstValueIterator | |
MapConstValueSet | |
MapFunctor | Converts a map to an STL style functor |
MapIterator | |
MapIterator::PairPointer | The pointer type of the iterator |
MapIteratorBase | |
MapKeyIterator | |
MappableGraphComponent | An empty mappable base graph class |
MappableGraphComponent::EdgeMap | ReadWrite map of the edges |
MappableGraphComponent::NodeMap | ReadWrite map of the nodes |
MapValueIterator | |
MapValueSet | |
MaxIDableGraphComponent | An empty max-idable base graph class |
MaxMatching | Edmonds' alternating forest maximum matching algorithm |
MinCostFlow | Implementation of an algorithm for finding a flow of value k (for small values of k ) having minimal total cost between 2 nodes |
MulMap | Product of two maps |
NegMap | Negative value of a map |
NodeSubGraphWrapper | A wrapper for hiding nodes from a graph |
NonConstMapWr | Helper class for calling kruskal with "constant" output map |
NullMap | Null map. (a.k.a. DoNothingMap) |
Path | A skeleton 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 |
QuotedStringReader | Reader class for quoted strings |
QuotedStringWriter | Writer class for quoted strings |
RangeError | |
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 |
RuntimeError | One of the two main subclasses of Exception |
ScaleMap | Scale a maps with a constant |
ShiftMap | Shift a maps with a constant |
SmartGraph | A smart graph class |
SmartGraph::SnapShot | Class to make a snapshot of the graph and to restrore to it later |
SmartGraphBase | Base of SmartGraph |
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 | Read write 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 | Read write map of the nodes to type T |
StaticGraph::OutEdgeIt | This iterator goes trough the outgoing edges of a node |
StaticSymGraph | An empty static graph class |
StaticSymGraph::Edge | The base type of the edge iterators |
StaticSymGraph::EdgeIt | This iterator goes through each edge |
StaticSymGraph::EdgeMap | Reference map of the edges to type T |
StaticSymGraph::InEdgeIt | This iterator goes trough the incoming edges of a node |
StaticSymGraph::Node | Copy consructor |
StaticSymGraph::NodeIt | This iterator goes through each node |
StaticSymGraph::NodeMap | |
StaticSymGraph::OutEdgeIt | This iterator goes trough the outgoing edges of a node |
StaticSymGraph::SymEdge | The base type of the symmetric edge iterators |
StaticSymGraph::SymEdgeIt | This iterator goes through each symmetric edge |
StaticSymGraph::SymEdgeMap | Reference map of the edges to type T |
StdMap | std::map wrapper |
SubBidirGraphWrapper | A wrapper for composing a subgraph of a bidirected graph made from a directed one |
SubBidirGraphWrapperBase::Edge | |
SubBidirGraphWrapperBase::EdgeMap | |
SubGraphWrapper | A graph wrapper for hiding nodes and edges from a graph |
SubMap | Difference of two maps |
Suurballe | Implementation of an algorithm for finding k edge-disjoint paths between 2 nodes of minimal total length |
SymPetStruct | Structure returned by addSymPetersen() |
Timer | Class measuring the cpu time and real time usage of the process |
TimeStamp | A class to store (cpu)time instances |
True | Basic type for defining "tags". A "YES" condidion for enable_if |
UndirGraph | Class describing the concept of Undirected Graphs |
UndirGraphEdge | |
UndirListGraph | An undirected list graph class |
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 |
UndirSmartGraph | A smart undirected graph class |
UninitializedParameter | Exception for uninitialized parameters |
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 |