_ErasableGraph | Modular erasable graph class |
_ExtendableGraph | Modular extendable graph class |
_FixId | |
_StaticGraph | Modular static graph class |
AbsMap | Absolute value of a map |
AddMap | Sum of two maps |
AdvancedController | A controller with preset running time for the simulated annealing class |
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 | |
AttributeReader | SectionReader for attributes |
AttributeWriter | SectionWriter for attributes |
BackwardMap | Returns the "backward" directed edge view of an undirected edge |
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 |
Bfs::DefDistMap | Named parameter for setting DistMap type |
Bfs::DefPredMap | Named parameter for setting PredMap type |
Bfs::DefProcessedMap | Named parameter for setting ProcessedMap type |
Bfs::DefProcessedMapToBeDefaultMap | Named parameter for setting the ProcessedMap type to be Graph::NodeMap<bool> |
Bfs::DefReachedMap | Named parameter for setting ReachedMap type |
Bfs::UninitializedParameter | Exception for uninitialized parameters |
BfsDefaultTraits | Default traits class of Bfs class |
BfsWizard | A class to make the usage of Bfs algorithm easier |
BfsWizardBase | Default traits used by BfsWizard |
BfsWizardDefaultTraits | Default traits class of Bfs function |
BidirGraphAdaptor | An adaptor 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 |
ColorSet | Maps int s to different Colors |
CombineMap | Combines of two maps using an STL (binary) functor |
CommonSectionReaderBase | Helper class for implementing the common SectionReaders |
CommonSectionWriterBase | Helper class for implementing the common SectionWriters |
ComposeMap | Composition of two maps |
ConEdgeIt | Iterator for iterating on edges connected the same nodes |
ConstMap | Constant map |
ConstXMap | Constant (read only) version of XMap |
ConstYMap | Constant (read only) version of YMap |
ContentReader | SectionReader for retrieve what is in the file |
ControllerBase | A base class for controllers |
ConvertMap | Convert the Value of a map to another type |
DataFormatError | |
DefaultGraphToEpsTraits | Default traits class of GraphToEps |
DefaultMapSelector | |
DefaultReader | The default item reader template class |
DefaultReaderTraits | Standard ReaderTraits for the GraphReader class |
DefaultSkipper | The default item reader for skipping a value in the stream |
DefaultWriter | The default item writer template class |
DefaultWriterTraits | Standard WriterTraits for the section writers |
DescriptorMap | Provides a mutable, continuous and unique descriptor for each item in the graph |
DescriptorMap::InverseMap | The inverse map type of DescriptorMap |
Dfs | DFS algorithm class |
Dfs::DefDistMap | Named parameter for setting DistMap type |
Dfs::DefPredMap | Named parameter for setting PredMap type |
Dfs::DefProcessedMap | Named parameter for setting ProcessedMap type |
Dfs::DefProcessedMapToBeDefaultMap | Named parameter for setting the ProcessedMap type to be Graph::NodeMap<bool> |
Dfs::DefReachedMap | Named parameter for setting ReachedMap type |
Dfs::UninitializedParameter | Exception for uninitialized parameters |
DfsDefaultTraits | Default traits class of Dfs class |
DfsWizard | A class to make the usage of the Dfs algorithm easier |
DfsWizardBase | Default traits used by DfsWizard |
DfsWizardDefaultTraits | Default traits class of Dfs function |
Dijkstra | Dijkstra algorithm class |
Dijkstra::DefDistMap | Named parameter for setting DistMap type |
Dijkstra::DefPredMap | Named parameter for setting PredMap type |
Dijkstra::DefProcessedMap | Named parameter for setting ProcessedMap type |
Dijkstra::DefProcessedMapToBeDefaultMap | Named parameter for setting the ProcessedMap type to be Graph::NodeMap<bool> |
Dijkstra::UninitializedParameter | Exception for uninitialized parameters |
DijkstraDefaultTraits | Default traits class of Dijkstra class |
DijkstraWizard | A class to make the usage of Dijkstra algorithm easier |
DijkstraWizardBase | Default traits used by DijkstraWizard |
DijkstraWizardDefaultTraits | Default traits class of Dijkstra function |
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 |
EdgeReader | SectionReader for reading labeled edges |
EdgeSetReader | SectionReader for reading a graph's edgeset |
EdgeSetWriter | SectionWriter for writing a graph's edgesets |
EdgeSubGraphAdaptor | An adaptor for hiding edges from a graph |
EdgeWriter | SectionWriter for writing labeled edges |
EntityBase | Skeleton of an entity class |
ErasableGraph | An empty erasable graph class |
ErasableGraphComponent | An empty erasable extended graph class |
ErasableUndirGraph | An empty erasable undirected graph class |
ErasingFirstGraphAdaptor | For blocking flows |
ErrorMessage | Exception-safe convenient "error message" class |
Exception | Generic exception class |
ExceptionMember | Exception safe wrapper class |
ExtendableGraph | An empty non-static graph class |
ExtendableGraphComponent | An empty extendable extended graph class |
ExtendableUndirGraph | An empty non-static undirected graph class |
extended_pair | A more customizable pair type than std::pair |
False | Basic type for defining "tags". A "NO" condition for enable_if |
FibHeap | Fibonacci Heap |
ForkMap | Applies all map setting operations to two maps |
ForwardMap | Returns the "forward" directed edge view of an undirected edge |
FullGraph | A full graph class |
FunctorMap | Converts an STL style functor to a map |
GraphAdaptorBase | |
GraphCopy | Class to copy a graph |
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 |
GridGraph | Grid graph class |
Heap | A concept structure describes the main interface of heaps |
IDableGraphComponent | An empty idable base graph class |
IdentityMap | Identity mapping |
IdMap | Provides an immutable and unique id for each item in the graph |
IdMap::InverseMap | The class represents the inverse of its owner (IdMap) |
InDegMap | Map of the node in-degrees |
InsertReader | Reader for standard containers |
Invalid | See INVALID, how to use it |
InvertableMap | General invertable graph-map type |
InvertableMap::InverseMap | The inverse map type |
IOError | |
IterableGraphComponent | An empty iterable base graph class |
IterableWriter | Writer for standard containers |
KruskalMapInput | Kruskal's input source |
KruskalSequenceOutput | A writable bool-map that makes a sequence of "true" keys |
LemonReader | Lemon Format reader class |
LemonReader::SectionReader | Abstract base class for reading a section |
LemonWriter | Lemon Format writer class |
LemonWriter::SectionWriter | Abstract base class for writing a section |
LineReader | Reader for read the whole line |
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 |
LpCplex | Interface for the CPLEX solver |
LpGlpk | Interface for the GLPK LP solver |
LpSkeleton | A skeleton class to implement LP solver interfaces |
LpSolverBase | Common base class for LP solvers |
LpSolverBase::Col | Refer to a column of the LP |
LpSolverBase::Constr | Linear constraint |
LpSolverBase::DualExpr | Linear expression of rows |
LpSolverBase::Expr | Linear expression of variables and a constant component |
LpSolverBase::Row | Refer to a row of the LP |
MapBase | Base class of maps |
MapConstIterator | |
MapConstIterator::Pointer | The pointer type of the iterator |
MapConstKeyIterator | |
MapConstKeySet | |
MapConstValueIterator | |
MapConstValueSet | |
MapFunctor | Converts a map to an STL style (unary) functor |
MapIterator | |
MapIterator::Pointer | The pointer type of the iterator |
MapIteratorBase | |
MappableGraphComponent | An empty mappable base graph class |
MappableGraphComponent::EdgeMap | ReadWrite map of the edges |
MappableGraphComponent::NodeMap | ReadWrite map of the nodes |
MapSet | |
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 |
NewEdgeSetAdaptor | Graph adaptor using a node set of another graph and an own edge set |
NewUndirEdgeSetAdaptor | Graph adaptor using a node set of another graph and an own undir edge set |
NodeReader | SectionReader for reading labeled nodes |
NodeSetReader | SectionReader for reading a graph's nodeset |
NodeSetWriter | SectionWriter for writing a graph's nodeset |
NodeSubGraphAdaptor | An adaptor for hiding nodes from a graph |
NodeWriter | SectionWriter for writing labeled nodes |
NonConstMapWr | Helper class for calling kruskal with "constant" output map |
NormSquareMap | Map of the normSquare() of an xy-map |
NotMap | Logical 'not' of a map |
NullMap | Null map. (a.k.a. DoNothingMap) |
OutDegMap | Map of the node out-degrees |
ParsedStringReader | Reader for parsed string |
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 |
PushBackReader | Reader for standard containers |
QuotedCharArrayWriter | Writer class for quoted char array |
QuotedStringReader | Reader class for quoted strings |
QuotedStringWriter | Writer class for quoted strings |
RadixHeap | A Radix Heap implementation |
RangeError | |
ReadMap | Readable map concept |
ReadWriteMap | Read/Writable map concept |
ReferenceMap | Dereferable map concept |
ResGraphAdaptor | An adaptor for composing the residual graph for directed flow and circulation problems |
ResGraphAdaptor::ResCap | Residual capacity map |
RevGraphAdaptor | A graph adaptor which reverses the orientation of the edges |
RuntimeError | One of the two main subclasses of Exception |
ScaleMap | Scales a maps with a constant |
ShiftMap | Shift a map with a constant |
SimAnn | Simulated annealing class |
SimAnnBase | Simulated annealing base class |
SimpleController | A simple controller for the simulated annealing class |
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 |
SourceMap | Returns the source of the given edge |
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 |
StdMap | std::map wrapper |
SubBidirGraphAdaptor | An adaptor for composing a subgraph of a bidirected graph made from a directed one |
SubBidirGraphAdaptorBase::Edge | |
SubBidirGraphAdaptorBase::EdgeMap | |
SubGraphAdaptor | A graph adaptor 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() |
TargetMap | Returns the target of the given edge |
TightEdgeFilterMap | A map for filtering the edge-set to those edges which are tight w.r.t. a node-potential and edge-distance |
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" condition for enable_if |
UnderFlowPriorityError | Exception thrown by RadixHeap |
UndirEdgeReader | SectionReader for reading labeled undirected edges |
UndirEdgeSetReader | SectionReader for reading a undirected graph's edgeset |
UndirEdgeSetWriter | SectionWriter for writing a undirected edgeset |
UndirEdgeWriter | SectionWriter for writing labeled undirected edges |
UndirFullGraph | An undirected full graph class |
UndirGraph | Class describing the concept of Undirected Graphs |
UndirGraph::Edge | The directed edge type |
UndirGraph::EdgeIt | This iterator goes through each directed edge |
UndirGraph::EdgeMap | Read write map of the directed edges to type T |
UndirGraph::IncEdgeIt | This iterator goes trough the incident undirected edges of a node |
UndirGraph::InEdgeIt | This iterator goes trough the incoming directed edges of a node |
UndirGraph::Node | |
UndirGraph::NodeIt | This iterator goes through each node |
UndirGraph::NodeMap | Read write map of the nodes to type T |
UndirGraph::OutEdgeIt | This iterator goes trough the outgoing directed edges of a node |
UndirGraph::UndirEdge | The base type of the undirected edge iterators |
UndirGraph::UndirEdgeIt | This iterator goes through each undirected edge |
UndirGraph::UndirEdgeMap | Read write map of the undirected edges to type T |
UndirGraphAdaptor | An undirected graph is made from a directed graph by an adaptor |
UndirGraphAdaptorBase::EdgeMap | |
UndirGraphReader | The undir graph reader class |
UndirGraphWriter | The undirected graph writer class |
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 |
XMap | Map of x-coordinates of an xy<>-map |
xy | A simple two dimensional vector (plainvector) implementation |
YMap | Map of y-coordinates of an xy<>-map |