AbsMap | Absolute value of a map |
AddMap | Sum of two maps |
AdvancedController | A controller with preset running time for the simulated annealing class |
AllEdgeLookUp | Fast look up of all edges between given endpoints |
AlterableBpUGraphComponent | An empty alteration notifier bipartite undirected graph class |
AlterableGraphComponent | An empty alteration notifier graph class |
AlterableUGraphComponent | An empty alteration notifier undirected graph class |
AlterationNotifier | Notifier class to notify observes about alterations in a container |
AlterationNotifier::ImmediateDetach | Exception which can be called from clear() and erase() |
AlterationNotifier::ObserverBase | ObserverBase is the base class for the observers |
ArgParser | Command line arguments parser |
ArgParser::RefType | Magic type for operator[] |
ArrayMap | Graph map based on the array storage |
AssertionFailedError | |
AttributeReader | SectionReader for attributes |
AttributeWriter | SectionWriter for attributes |
BackInserterBoolMap | Writable bool map for logging each true assigned element in a back insertable container |
BackwardMap | Returns the "backward" directed edge view of an undirected edge |
BaseBpUGraphComponent | An empty base bipartite undirected graph class |
BaseBpUGraphComponent::ANode | Helper class for A-nodes |
BaseBpUGraphComponent::BNode | Helper class for B-nodes |
BaseGraphComponent | An empty base graph class |
BaseUGraphComponent | An empty base undirected graph class |
BaseUGraphComponent::UEdge | Undirected edge class of the graph |
BellmanFord | BellmanFord algorithm class |
BellmanFord::ActiveIt | Lemon iterator for get the active nodes |
BellmanFord::DefDistMap | Named parameter for setting DistMap type |
BellmanFord::DefOperationTraits | Named parameter for setting OperationTraits type |
BellmanFord::DefPredMap | Named parameter for setting PredMap type Named parameter for setting PredMap type |
BellmanFord::UninitializedParameter | Exception for uninitialized parameters |
BellmanFordDefaultOperationTraits | Default OperationTraits for the BellmanFord algorithm class |
BellmanFordDefaultTraits | Default traits class of BellmanFord class |
BellmanFordWizard | A class to make the usage of BellmanFord algorithm easier |
BellmanFordWizardBase | Default traits used by BellmanFordWizard |
BellmanFordWizardDefaultTraits | Default traits class of BellmanFord function |
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 |
BfsVisit | BFS Visit algorithm class |
BfsVisit::DefReachedMap | Named parameter for setting ReachedMap type |
BfsVisit::UninitializedParameter | Exception for uninitialized parameters |
BfsVisitDefaultTraits | Default traits class of BfsVisit class |
BfsVisitor | Visitor class for bfs |
BfsWizard | A class to make the usage of Bfs algorithm easier |
BfsWizardBase | Default traits used by BfsWizard |
BfsWizardDefaultTraits | Default traits class of Bfs function |
BinHeap | A Binary Heap implementation |
BiVariant | Simple Variant type for two types |
BoundingBox | A class to calculate or store the bounding box of plainvectors |
BpNodeSetReader | SectionReader for reading a bipartite graph's nodeset |
BpNodeSetWriter | SectionWriter for writing a bipartite graph's nodeset |
BpUGraph | Class describing the concept of Bipartite Undirected Graphs |
BpUGraph::ANode | Helper class for ANodes |
BpUGraph::ANodeIt | This iterator goes through each ANode |
BpUGraph::ANodeMap | Read write map of the ANodes to type T |
BpUGraph::BNode | Helper class for BNodes |
BpUGraph::BNodeIt | This iterator goes through each BNode |
BpUGraph::BNodeMap | Read write map of the BNodes to type T |
BpUGraph::Edge | The directed edge type |
BpUGraph::EdgeIt | This iterator goes through each directed edge |
BpUGraph::EdgeMap | Read write map of the directed edges to type T |
BpUGraph::IncEdgeIt | This iterator goes trough the incident undirected edges of a node |
BpUGraph::InEdgeIt | This iterator goes trough the incoming directed edges of a node |
BpUGraph::Node | The base type of node iterators, or in other words, the trivial node iterator |
BpUGraph::NodeIt | This iterator goes through each node |
BpUGraph::NodeMap | Read write map of the nodes to type T |
BpUGraph::OutEdgeIt | This iterator goes trough the outgoing directed edges of a node |
BpUGraph::UEdge | The base type of the undirected edge iterators |
BpUGraph::UEdgeIt | This iterator goes through each undirected edge |
BpUGraph::UEdgeMap | Read write map of the undirected edges to type T |
BpUGraphAdaptor | Trivial Bipartite Undirected Graph Adaptor |
BpUGraphAdaptorBase | Base type for the Bipartite Undirected Graph Adaptors |
BpUGraphAdaptorExtender | Extender for the BpUGraphAdaptors |
BpUGraphCopy | Class to copy a bipartite undirected graph |
BpUGraphExtender | Extender for the BpUGraphs |
BpUGraphReader | The bipartite graph reader class |
BpUGraphWriter | The bipartite graph writer class |
BucketHeap | A Bucket Heap implementation |
CapacityScaling | Implementation of the capacity scaling algorithm for finding a minimum cost flow |
CapacityScaling::ResidualDijkstra | Special implementation of the Dijkstra algorithm for finding shortest paths in the residual network |
Circulation | Push-relabel algorithm for the Network Circulation Problem |
Circulation::DefElevator | Named parameter for setting Elevator type |
Circulation::DefFlowMap | Named parameter for setting FlowMap type |
Circulation::DefStandardElevator | Named parameter for setting Elevator type |
CirculationDefaultTraits | Default traits class of Circulation class |
ClearableBpUGraphComponent | An empty clearable base bipartite undirected graph class |
ClearableGraphComponent | An empty clearable base graph class |
ClearableUGraphComponent | An empty clearable base undirected graph class |
Color | Data structure representing RGB colors |
CombineMap | Combine of two maps using an STL (binary) functor |
CombinePolicies | CombinePolicies |
ComposeMap | Composition of two maps |
ConEdgeIt | Iterator for iterating on edges connected the same nodes |
ConstMap | Constant map |
ConstMap< K, Const< V, v > > | Constant map with inlined constant value |
ConstMapIt | Iterator for maps with possibility of getting values |
ConstMatrixColMap | Map for the column view of the matrix |
ConstMatrixRowMap | Map for the row view of the matrix |
ConstrainedShortestPath | Algorithms for the Resource Constrained Shortest Path Problem |
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 |
ConUEdgeIt | Iterator for iterating on uedges connected the same nodes |
ConvertMap | Convert the Value of a map to another type using the default conversion |
CostScaling | Implementation of the cost scaling algorithm for finding a minimum cost flow |
CostScaling::ReducedCostMap | Map adaptor class for handling reduced edge costs |
CostScaling::ResidualCostMap | Map adaptor class for handling residual edge costs |
Counter | A counter class |
CycleCanceling | Implementation of a cycle-canceling algorithm for finding a minimum cost flow |
CycleCanceling::ResidualCostMap | Map adaptor class for handling residual edge costs |
DagLongestPathOperationTraits | Inverse OperationTraits for the DagShortestPath algorithm class |
DagLongestPathTraits | Inverse traits class of DagShortestPath class |
DagShortestPath | DagShortestPath algorithm class |
DagShortestPath::DefDistMap | Named parameter for setting DistMap type |
DagShortestPath::DefOperationTraits | Named parameter for setting OperationTraits type |
DagShortestPath::DefPredMap | Named parameter for setting PredMap type Named parameter for setting PredMap type |
DagShortestPath::UninitializedParameter | Exception for uninitialized parameters |
DagShortestPathDefaultOperationTraits | Default OperationTraits for the DagShortestPath algorithm class |
DagShortestPathDefaultTraits | Default traits class of DagShortestPath class |
DagShortestPathWizard | A class to make the usage of DagShortestPath algorithm easier |
DagShortestPathWizardBase | Default traits used by DagShortestPathWizard |
DagShortestPathWizardDefaultTraits | Default traits class of DagShortestPath function |
DataFormatError | |
DebugMap | Graph map based on the std::vector storage |
DefaultGraphToEpsTraits | Default traits class of GraphToEps |
DefaultMap | |
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 |
DfsVisit | DFS Visit algorithm class |
DfsVisit::DefReachedMap | Named parameter for setting ReachedMap type |
DfsVisit::UninitializedParameter | Exception for uninitialized parameters |
DfsVisitDefaultTraits | Default traits class of DfsVisit class |
DfsVisitor | Visitor class for dfs |
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 | |
Dijkstra::DefHeap | Named parameter for setting heap and cross reference type |
Dijkstra::DefOperationTraits | Named parameter for setting OperationTraits type |
Dijkstra::DefPredMap | |
Dijkstra::DefProcessedMap | |
Dijkstra::DefProcessedMapToBeDefaultMap | Named parameter for setting the ProcessedMap type to be Graph::NodeMap<bool> |
Dijkstra::DefStandardHeap | Named parameter for setting heap and cross reference type with automatic allocation |
Dijkstra::UninitializedParameter | Exception for uninitialized parameters |
DijkstraDefaultOperationTraits | Default OperationTraits for the Dijkstra algorithm class |
DijkstraDefaultTraits | Default traits class of Dijkstra class |
DijkstraWidestPathOperationTraits | Widest path OperationTraits for the Dijkstra algorithm 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 |
DinitzSleatorTarjan | Dinitz-Sleator-Tarjan algorithms class |
DinitzSleatorTarjan::DefFlowMap | Named parameter for setting FlowMap type |
DinitzSleatorTarjan::InvalidArgument | Exception for the case when the source equals the target |
DinitzSleatorTarjanDefaultTraits | Default traits class of DinitzSleatorTarjan class |
DirUGraphAdaptor | A directed graph is made from an undirected graph by an adaptor |
DirUGraphAdaptorBase | Base of direct undirected graph adaptor |
DistLog | Measure a distribution |
DistLog2 | Measure a two dimensional distribution |
DivMap | Quotient of two maps |
DynamicAsymMatrixMap | Dynamic Asymmetric Matrix Map |
DynamicAsymMatrixMap::FirstKeyProxy | Proxy class for the first key type |
DynamicAsymMatrixMap::SecondKeyProxy | Proxy class for the second key type |
DynamicMatrixMap | Container for store values for each ordered pair of graph items |
DynamicSymMatrixMap | Container for store values for each unordered pair of graph items |
DynamicTree | The dynamic tree data structure of Sleator and Tarjan |
DynEdgeLookUp | Dynamic edge look up between given endpoints |
EdgeLookUp | Fast edge look up between given endpoints |
EdgeMapReader | SectionReader for reading extra edge maps |
EdgeMapWriter | SectionWriter for writing extra edge maps |
EdgeReader | SectionReader for reading labeled edges |
EdgeSetExtender | Extender for the EdgeSets |
EdgeSetReader | SectionReader for reading a graph's edgeset |
EdgeSetWriter | SectionWriter for writing a graph's edgesets |
EdgeSubGraph | Graph which uses a subset of another graph's edges |
EdgeSubGraphAdaptor | An adaptor for hiding edges from a graph |
EdgeSubGraphBase | Base for the EdgeSubGraph |
EdgeSubUGraphAdaptor | An adaptor for hiding undirected edges from an undirected graph |
EdgeWriter | SectionWriter for writing named edges |
EdmondsKarp | Edmonds-Karp algorithms class |
EdmondsKarp::DefFlowMap | Named parameter for setting FlowMap type |
EdmondsKarp::InvalidArgument | Exception for the case when the source equals the target |
EdmondsKarpDefaultTraits | Default traits class of EdmondsKarp class |
Elevator | Class for handling "labels" in push-relabel type algorithms |
EntityBase | Skeleton of an entity class |
EpsDrawer | A simple tool to create .eps files |
ErasableBpUGraphComponent | An empty erasable base bipartite undirected graph class |
ErasableGraphComponent | An empty erasable graph class |
ErasableUGraphComponent | An empty erasable base undirected graph class |
ErasingFirstGraphAdaptor | For blocking flows |
ErrorMessage | Exception-safe convenient "error message" class |
EulerIt | Euler iterator for directed graphs |
Exception | Generic exception class |
ExceptionMember | Exception safe wrapper class |
ExtendableBpUGraphComponent | An empty extendable base undirected graph class |
ExtendableGraphComponent | An empty extendable graph class |
ExtendableUGraphComponent | An empty extendable base undirected graph class |
ExtendFindEnum | A Extend-Find data structure implementation which is able to enumerate the components |
ExtendFindEnum::ClassIt | Lemon style iterator for the classes |
ExtendFindEnum::ItemIt | Lemon style iterator for the items of a component |
False | Basic type for defining "tags". A "NO" condition for enable_if |
FibHeap | Fibonacci Heap |
FileOpenError | |
FillBoolMap | Writable bool map for filling each true assigned element with a given value |
FilterMapIt | Iterator for maps which filters items by the values |
FloydWarshall | FloydWarshall algorithm class |
FloydWarshall::DefDistMap | Named parameter for setting DistMap type |
FloydWarshall::DefOperationTraits | Named parameter for setting OperationTraits type |
FloydWarshall::DefPredMap | Named parameter for setting PredMap type Named parameter for setting PredMap type |
FloydWarshall::UninitializedParameter | Exception for uninitialized parameters |
FloydWarshallDefaultOperationTraits | Default OperationTraits for the FloydWarshall algorithm class |
FloydWarshallDefaultTraits | Default traits class of FloydWarshall class |
ForkMap | Just readable version of ForkWriteMap |
ForkWriteMap | Applies all map setting operations to two maps |
ForwardMap | Returns the "forward" directed edge view of an undirected edge |
FredmanTarjan | FredmanTarjan algorithm class to find a minimum spanning tree |
FredmanTarjan::DefTreeMap | Named parameter for setting TreeMap |
FredmanTarjan::UninitializedParameter | Exception for uninitialized parameters |
FredmanTarjanDefaultTraits | Default traits class of FredmanTarjan class |
FrontInserterBoolMap | Writable bool map for logging each true assigned element in a front insertable container |
FullBpUGraph | An undirected full bipartite graph class |
FullGraph | A full graph class |
FullUGraph | An undirected full graph class |
FunctorMap | Converts an STL style functor to a map |
GoldbergTarjan | Goldberg-Tarjan algorithms class |
GoldbergTarjan::DefElevator | Named parameter for setting Elevator type |
GoldbergTarjan::DefFlowMap | Named parameter for setting FlowMap type |
GoldbergTarjan::DefStandardElevator | Named parameter for setting Elevator type |
GoldbergTarjan::InvalidArgument | Exception for the case when s=t |
GoldbergTarjanDefaultTraits | Default traits class of GoldbergTarjan class |
GomoryHuTree | Gomory-Hu cut tree algorithm |
Graph | Class describing the concept of Directed Graphs |
Graph::Edge | Class for identifying an edge of the graph |
Graph::EdgeIt | This iterator goes through each edge |
Graph::EdgeMap | Read write map of the edges to type T |
Graph::InEdgeIt | This iterator goes trough the incoming edges of a node |
Graph::Node | Class for identifying a node of the graph |
Graph::NodeIt | This iterator goes through each node |
Graph::NodeMap | Read write map of the nodes to type T |
Graph::OutEdgeIt | This iterator goes trough the outgoing edges of a node |
GraphAdaptor | Trivial Graph Adaptor |
GraphAdaptorBase | Base type for the Graph Adaptors |
GraphAdaptorExtender | Extender for the GraphAdaptors |
GraphCopy | Class to copy a graph |
GraphExtender | Extender for the Graphs |
GraphIncIt | Skeleton class for graph InEdgeIt and OutEdgeIt |
GraphItem | Skeleton class for graph Node and Edge types |
GraphItemIt | 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 |
GridUGraph | Grid graph class |
GridUGraph::ColMap | Map to get the column of the nodes |
GridUGraph::IndexMap | Map to get the indices of the nodes as dim2::Point<int> |
GridUGraph::RowMap | Map to get the row of the nodes |
HaoOrlin | Hao-Orlin algorithm to find a minimum cut in directed graphs |
Heap | A concept structure describes the main interface of heaps |
HeapUnionFind | A Union-Find data structure implementation which is able to store a priority for each item and retrieve the minimum of each class |
HeapUnionFind::ClassIt | Class iterator |
HeapUnionFind::ItemIt | Lemon style iterator for the items of a class |
HeightPolicy | HeightPolicy stops the search when a given height is reached or exceeds |
HyperCubeGraph | HyperCube graph class |
HyperCubeGraph::HyperMap | Linear combination map |
IDableBpUGraphComponent | An empty idable base bipartite undirected graph class |
IDableGraphComponent | An empty idable base graph class |
IDableUGraphComponent | An empty idable base undirected graph class |
IdentityMap | Identity map |
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 |
InserterBoolMap | Writable bool map for storing each true assigned element in an insertable container |
InsertReader | Reader for standard containers |
IntegerMap | Map for storing values for keys from the range [0..size-1] |
Invalid | Dummy type to make it easier to make invalid iterators |
InvertableMap | General invertable graph-map type |
InvertableMap::InverseMap | The inverse map type |
InvertableMap::ValueIterator | Forward iterator for values |
IoError | |
IterableBoolMap | Dynamic iterable bool map |
IterableBoolMap::FalseIt | Iterator for the keys mapped to false |
IterableBoolMap::ItemIt | Iterator for the keys mapped to a given value |
IterableBoolMap::Reference | Refernce to the value of the map |
IterableBoolMap::TrueIt | Iterator for the keys mapped to true |
IterableBpUGraphComponent | An empty iterable bipartite undirected graph class |
IterableGraphComponent | An empty iterable graph class |
IterableIntMap | Dynamic iterable integer map |
IterableIntMap::ItemIt | Iterator for the keys with the same value |
IterableIntMap::Reference | Refernce to the value of the map |
IterableUGraphComponent | An empty iterable undirected graph class |
IterableValueMap | Dynamic iterable map for comparable values |
IterableValueMap::ItemIt | Iterator for the keys with the same value |
IterableValueMap::ValueIterator | Forward iterator for values |
IterableWriter | Writer for standard containers |
IterationPolicy | IterationPolicy limits the number of iterations and the number of iterations without improvement |
Johnson | Johnson algorithm class |
Johnson::DefDistMap | Named parameter for setting DistMap type |
Johnson::DefHeap | Named parameter for setting heap and cross reference type |
Johnson::DefOperationTraits | Named parameter for setting OperationTraits type |
Johnson::DefPredMap | Named parameter for setting PredMap type Named parameter for setting PredMap type |
Johnson::DefStandardHeap | Named parameter for setting heap and cross reference type with automatic allocation |
Johnson::UninitializedParameter | Exception for uninitialized parameters |
JohnsonDefaultOperationTraits | Default OperationTraits for the Johnson algorithm class |
JohnsonDefaultTraits | Default traits class of Johnson class |
Kruskal | Kruskal's algorithm to find a minimum cost tree of a graph |
Kruskal::DefRadixSort | Named parameter for setting the sort function to radix sort |
Kruskal::DefSortCompare | Named parameter for setting the comparator object of the standard sort |
Kruskal::DefTreeMap | Named parameter for setting TreeMap |
KruskalDefaultTraits | Default traits class of Kruskal class |
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 |
LinkedElevator | Class for handling "labels" in push-relabel type algorithms |
ListBpUGraph | A smart bipartite undirected graph class |
ListBpUGraph::Snapshot | Class to make a snapshot of the graph and restore to it later |
ListEdgeSet | Graph using a node set of another graph and an own edge set |
ListGraph | A list graph class |
ListGraph::Snapshot | Class to make a snapshot of the graph and restore to it later |
ListPath | A structure for representing directed paths in a graph |
ListPath::EdgeIt | Iterator class to iterate on the edges of the paths |
ListUEdgeSet | Graph using a node set of another graph and an own uedge set |
ListUGraph | An undirected list graph class |
ListUGraph::Snapshot | Class to make a snapshot of the graph and restore to it later |
LogicError | One of the two main subclasses of Exception |
LpColNameMap | The map for the name of the lp variables |
LpColNameWriteMap | Writeable map for the name of the lp variables |
LpColReader | Lp variable item reader for Lemon IO |
LpColWriter | Lp variable item writer for Lemon IO |
LpCplex | Interface for the CPLEX solver |
LpGlpk | Interface for the GLPK LP solver |
LpReader | Lp section reader for lemon IO |
LpResultMap | The map for the result of the lp variables |
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 |
LpSoplex | Interface for the SOPLEX solver |
LpWriter | Lp section writer for lemon IO |
MapBase | Base class of maps |
MapExtender | Extender for maps |
MapFunctor | Converts a map to an STL style (unary) functor |
MapIt | Iterator for maps with possibility of changing values |
MappableBpUGraphComponent | An empty mappable base bipartite undirected graph class |
MappableBpUGraphComponent::ANodeMap | ReadWrite map of the A-nodes |
MappableBpUGraphComponent::BNodeMap | ReadWrite map of the B-nodes |
MappableGraphComponent | An empty mappable graph class |
MappableGraphComponent::EdgeMap | ReadWrite map of the edges |
MappableGraphComponent::NodeMap | ReadWrite map of the nodes |
MappableUGraphComponent | An empty mappable base bipartite undirected graph class |
MappableUGraphComponent::UEdgeMap | ReadWrite map of the uedges |
MatchingBpUGraphAdaptor | Bipartite graph adaptor to implement matching algorithms |
MatrixColMap | Map for the column view of the matrix |
MatrixRowMap | Map for the coloumn view of the matrix |
MaxBipartiteMatching | Bipartite Max Cardinality Matching algorithm |
MaxCardinalitySearch | Maximum Cardinality Search algorithm class |
MaxCardinalitySearch::DefCardinalityMap | Named parameter for setting CardinalityMap type |
MaxCardinalitySearch::DefHeap | Named parameter for setting heap and cross reference type |
MaxCardinalitySearch::DefProcessedMap | Named parameter for setting ProcessedMap type |
MaxCardinalitySearch::DefStandardHeap | Named parameter for setting heap and cross reference type with automatic allocation |
MaxCardinalitySearch::UninitializedParameter | Exception for uninitialized parameters |
MaxCardinalitySearchDefaultTraits | Default traits class of MaxCardinalitySearch class |
MaxMatching | Edmonds' alternating forest maximum matching algorithm |
MaxWeightedBipartiteMatching | Bipartite Max Weighted Matching algorithm |
MaxWeightedBipartiteMatching::DefHeap | Named parameter for setting heap and cross reference type |
MaxWeightedBipartiteMatching::DefStandardHeap | Named parameter for setting heap and cross reference type with automatic allocation |
MaxWeightedBipartiteMatching::UninitializedParameter | Exception for uninitialized parameters |
MaxWeightedBipartiteMatchingDefaultTraits | Default traits class for weighted bipartite matching algoritms |
MaxWeightedMatching | Weighted matching in general undirected graphs |
MaxWeightedMatching::BlossomIt | Lemon iterator for get the items of the blossom |
MaxWeightedPerfectMatching | Weighted perfect matching in general undirected graphs |
MaxWeightedPerfectMatching::BlossomIt | Lemon iterator for get the items of the blossom |
MinCostArborescence | MinCostArborescence algorithm class |
MinCostArborescence::DefArborescenceMap | Named parameter for setting ArborescenceMap type |
MinCostArborescence::DefPredMap | Named parameter for setting PredMap type |
MinCostArborescence::DualIt | Lemon iterator for get a dual variable |
MinCostArborescence::UninitializedParameter | Exception for uninitialized parameters |
MinCostArborescenceDefaultTraits | Default traits class of MinCostArborescence class |
MinCostFlow | An efficient algorithm for finding a minimum cost flow |
MinCostMaxBipartiteMatching | Bipartite Min Cost Matching algorithm |
MinCostMaxBipartiteMatching::DefHeap | Named parameter for setting heap and cross reference type |
MinCostMaxBipartiteMatching::DefStandardHeap | Named parameter for setting heap and cross reference type with automatic allocation |
MinCostMaxBipartiteMatching::UninitializedParameter | Exception for uninitialized parameters |
MinCostMaxBipartiteMatchingDefaultTraits | Default traits class for minimum cost bipartite matching algoritms |
MinCostMaxFlow | An efficient algorithm for finding a minimum cost maximum flow |
MinMeanCycle | Implementation of Howard's algorithm for finding a minimum mean directed cycle |
MipCplex | Interface for the CPLEX MIP solver |
MipGlpk | Interface for the GLPK MIP solver |
MipSolverBase | Common base class for MIP solvers |
MulMap | Product of two maps |
NagamochiIbaraki | Calculates the minimum cut in an undirected graph |
NagamochiIbaraki::DefHeap | Named parameter for setting heap and cross reference type |
NagamochiIbaraki::DefStandardHeap | Named parameter for setting heap and cross reference type with automatic allocation |
NagamochiIbaraki::DefUnitCapacity | Named parameter for setting the capacity type to constMap<UEdge, int, 1>() |
NagamochiIbaraki::UninitializedParameter | Exception for uninitialized parameters |
NagamochiIbarakiDefaultTraits | Default traits class of NagamochiIbaraki class |
NegMap | Negative value of a map |
NegWriteMap | Negative value of a map (ReadWrite version) |
NetworkSimplex | Implementation of the network simplex algorithm for finding a minimum cost flow |
NetworkSimplex::BestEligiblePivotRule | Implementation of the "Best Eligible" pivot rule for the network simplex algorithm |
NetworkSimplex::BlockSearchPivotRule | Implementation of the "Block Search" pivot rule for the network simplex algorithm |
NetworkSimplex::CandidateListPivotRule | Implementation of the "Candidate List" pivot rule for the network simplex algorithm |
NetworkSimplex::FirstEligiblePivotRule | Implementation of the "First Eligible" pivot rule for the network simplex algorithm |
NetworkSimplex::LimitedSearchPivotRule | Implementation of the "Limited Search" pivot rule for the network simplex algorithm |
NetworkSimplex::ReducedCostMap | Map adaptor class for handling reduced edge costs |
NoCounter | 'Do nothing' version of Counter |
NodeMapReader | SectionReader for reading extra node maps |
NodeMapWriter | SectionWriter for writing extra node maps |
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 |
NodeSubUGraphAdaptor | An adaptor for hiding nodes from an undirected graph |
NodeWriter | SectionWriter for writing named nodes |
NormSquareMap | Map of the normSquare() of a Point-map |
NoTimeReport | 'Do nothing' version of TimeReport |
NotMap | Logical 'not' of a map |
NotWriteMap | Logical 'not' of a map (ReadWrie version) |
NullMap | Null map. (a.k.a. DoNothingMap) |
OutDegMap | Map of the node out-degrees |
PairReader | Reader for std::pair |
PairWriter | Writer for standard pairs |
Palette | Map int s to different Colors |
ParsedStringReader | Reader for parsed string |
Path | A skeleton structure for representing directed paths in a graph |
Path | A structure for representing directed paths in a graph |
Path::EdgeIt | Lemon style iterator for path edges |
Path::EdgeIt | Lemon style iterator for path edges |
PathDumper | A skeleton structure for path dumpers |
PathDumper::EdgeIt | Lemon style iterator for path edges |
PathDumper::RevEdgeIt | Lemon style iterator for path edges |
PathNodeIt | Class which helps to iterate the nodes of a path |
PathReader | Item reader for paths |
PathWriter | Item writer for paths |
PetStruct | |
PlanarColoring | Coloring planar graphs |
PlanarDrawing | Schnyder's planar drawing algorithms |
PlanarEmbedding | Planar embedding of an undirected simple graph |
PlanarityChecking | Planarity checking of an undirected simple graph |
Point | A simple two dimensional vector (plainvector) implementation |
PolicyAndCombination | Some basic methode, how tow Policies can be combined |
Polynomial | Simple polinomial class |
PotentialDifferenceMap | Potential difference map |
PrBipartiteMatching | Max cardinality matching algorithm based on push-relabel principle |
Preflow | Preflow algorithms class |
Preflow::DefElevator | Named parameter for setting Elevator type |
Preflow::DefFlowMap | Named parameter for setting FlowMap type |
Preflow::DefStandardElevator | Named parameter for setting Elevator type |
Preflow::UninitializedParameter | Exception for uninitialized parameters |
PreflowDefaultTraits | Default traits class of Preflow class |
Prim | Prim algorithm class to find a minimum spanning tree |
Prim::DefHeap | Named parameter for setting heap and cross reference type |
Prim::DefPredMap | Named parameter for setting PredMap type |
Prim::DefProcessedMap | Named parameter for setting ProcessedMap type |
Prim::DefStandardHeap | Named parameter for setting heap and cross reference type with automatic allocation |
Prim::DefTreeMap | Named parameter for setting TreeMap |
Prim::UninitializedParameter | Exception for uninitialized parameters |
PrimDefaultTraits | Default traits class of Prim class |
PushBackReader | Reader for standard containers |
QuotedCharArrayWriter | Writer class for quoted char array |
QuotedCharReader | Reader class for quoted strings |
QuotedCharWriter | Writer class for quoted chars |
QuotedStringReader | Reader class for quoted strings |
QuotedStringWriter | Writer class for quoted strings |
RadixHeap | A Radix Heap implementation |
RadixHeap::UnderFlowPriorityError | Exception thrown by RadixHeap |
Random | Mersenne Twister random number generator |
RangeError | |
ReadMap | Readable map concept |
ReadMatrixMap | Readable matrix map concept |
ReadWriteMap | Read/writable map concept |
ReadWriteMatrixMap | Read/Writable map concept |
ReferenceMap | Dereferable map concept |
ReferenceMatrixMap | Dereferable matrix map concept |
RefPtr | Reference counted pointer |
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 map with a constant |
ScaleWriteMap | Scales a map with a constant (ReadWrite version) |
SettingOrderBoolMap | Writable bool map for storing the sequence number of true assignments |
ShiftMap | Shift a map with a constant |
ShiftWriteMap | Shift a map with a constant (ReadWrite version) |
SimAnn | Simulated annealing class |
SimAnnBase | Simulated annealing abstract base class |
SimpleBucketHeap | A Simplified Bucket Heap implementation |
SimpleController | A simple controller for the simulated annealing class |
SimpleMap | Simple wrapping of a map |
SimplePath | A structure for representing directed paths in a graph |
SimplePath::EdgeIt | Iterator class to iterate on the edges of the paths |
SimpleWriteMap | Simple writable wrapping of a map |
SmartBpUGraph | A smart bipartite undirected graph class |
SmartBpUGraph::Snapshot | Class to make a snapshot of the graph and to restrore to it later |
SmartEdgeSet | Graph using a node set of another graph and an own edge set |
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 |
SmartUEdgeSet | Graph using a node set of another graph and an own uedge set |
SmartUGraph | A smart undirected graph class |
SmartUGraph::Snapshot | Class to make a snapshot of the graph and to restrore to it later |
SourceMap | Returns the source of the given edge |
SplitGraphAdaptor | Split graph adaptor class |
SplitGraphAdaptor::CombinedEdgeMap | EdgeMap combined from an original EdgeMap and NodeMap |
SplitGraphAdaptor::CombinedNodeMap | NodeMap combined from two original NodeMap |
SplitGraphAdaptorBase | Base class for split graph adaptor |
StaticPath | A structure for representing directed paths in a graph |
StaticPath::EdgeIt | Iterator class to iterate on the edges of the paths |
StdMap | Map based on std::map |
SteinerTree | Algorithm for the 2-approximation of Steiner Tree problem |
StoreBoolMap | Writable bool map for logging each true assigned element |
SubGraph | Graph which uses a subset of another graph's nodes and edges |
SubGraphAdaptor | A graph adaptor for hiding nodes and edges from a graph |
SubGraphBase | Base for the SubGraph |
SubMap | Difference of two maps |
SubMapExtender | Extender for maps which use a subset of the items |
SubUGraphAdaptor | A graph adaptor for hiding nodes and edges from an undirected graph |
Suurballe | Implementation of an algorithm for finding edge-disjoint paths between two nodes having minimum total length |
Suurballe::ResidualDijkstra | Special implementation of the Dijkstra algorithm for finding shortest paths in the residual network |
SwapBpUGraphAdaptor | Bipartite graph adaptor which swaps the two nodeset |
TabuSearch | TabuSearch main class |
TabuSearch::BadParameterError | Thrown by setting the size of the tabu-set and the given size is less than 2 |
TabuSearchDefaultTraits | Default Traits for TabuSearch class |
TabuSearchPolicyConcept | Policy hierarchy to controll the search algorithm |
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 |
TimePolicy | TimePolicy limits the time for searching |
Timer | Class for measuring the cpu time and real time usage of the process |
TimeReport | Same as Timer but prints a report on destruction |
TimeStamp | A class to store (cpu)time instances |
Tolerance | A class to provide a basic way to handle the comparison of numbers that are obtained as a result of a probably inexact computation |
Tolerance< double > | Double specialization of Tolerance |
Tolerance< float > | Float specialization of Tolerance |
Tolerance< int > | Integer specialization of Tolerance |
Tolerance< long double > | Long double specialization of Tolerance |
Tolerance< long int > | Long integer specialization of Tolerance |
Tolerance< unsigned int > | Unsigned integer specialization of Tolerance |
Tolerance< unsigned long int > | Unsigned long integer specialization of Tolerance |
True | Basic type for defining "tags". A "YES" condition for enable_if |
UEdgeMapReader | SectionReader for reading extra undirected edge maps |
UEdgeMapWriter | SectionWriter for writing extra undirected edge maps |
UEdgeReader | SectionReader for reading labeled undirected edges |
UEdgeSetExtender | Extender for the UEdgeSets |
UEdgeSetReader | SectionReader for reading a undirected graph's edgeset |
UEdgeSetWriter | SectionWriter for writing a undirected edgeset |
UEdgeWriter | SectionWriter for writing named undirected edges |
UEulerIt | Euler iterator for undirected graphs |
UGraph | Class describing the concept of Undirected Graphs |
UGraph::Edge | The directed edge type |
UGraph::EdgeIt | This iterator goes through each directed edge |
UGraph::EdgeMap | Read write map of the directed edges to type T |
UGraph::IncEdgeIt | This iterator goes trough the incident undirected edges of a node |
UGraph::InEdgeIt | This iterator goes trough the incoming directed edges of a node |
UGraph::Node | The base type of node iterators, or in other words, the trivial node iterator |
UGraph::NodeIt | This iterator goes through each node |
UGraph::NodeMap | Read write map of the nodes to type T |
UGraph::OutEdgeIt | This iterator goes trough the outgoing directed edges of a node |
UGraph::UEdge | The base type of the undirected edge iterators |
UGraph::UEdgeIt | This iterator goes through each undirected edge |
UGraph::UEdgeMap | Read write map of the undirected edges to type T |
UGraphAdaptor | Trivial undirected graph adaptor |
UGraphAdaptorBase | Base type for the Graph Adaptors |
UGraphAdaptorExtender | Extender for the UGraphAdaptors |
UGraphCopy | Class to copy an undirected graph |
UGraphExtender | Extender for the UGraphs |
UGraphReader | The undirected graph reader class |
UGraphWriter | The undirected graph writer class |
UndirGraphAdaptor | An undirected graph is made from a directed graph by an adaptor |
UndirGraphAdaptor::CombinedEdgeMap | EdgeMap combined from two original EdgeMap |
UndirGraphExtender | BaseGraph to BaseUGraph extender |
UnformattedReader | Reader class for unformatted strings |
UnformattedWriter | Writer class for quoted strings |
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 |
UnionFindEnum::ClassIt | Lemon style iterator for the representant items |
UnionFindEnum::ItemIt | Lemon style iterator for the items of a component |
UPetStruct | |
Variant | Variant type |
VariantTypeMap | Helper class for Variant |
VectorMap | Graph map based on the std::vector storage |
VMapBase | Base class of the virtual maps |
VReadMap | Makes a virtual map from a ReadMap |
VReadWriteMap | Makes a virtual map from a ReadWriteMap |
VRefMapBase | Base class of the virtual reference maps |
VWriteMap | Makes a virtual map from a WriteMap |
WriteMap | Writable map concept |
WriteMatrixMap | Writable map concept |
XMap | Map of x-coordinates of a Point-map |
YMap | Map of y-coordinates of a Point-map |