CBellmanFord< GR, LEN, TR >::ActiveIt | LEMON iterator for getting the active nodes |
►CBpGraph::Arc | The arc type of the graph |
CBpGraph::ArcIt | Iterator class for the arcs |
CBpGraph::InArcIt | Iterator class for the incoming arcs of a node |
CBpGraph::OutArcIt | Iterator class for the outgoing arcs of a node |
►CGraph::Arc | The arc type of the graph |
CGraph::ArcIt | Iterator class for the arcs |
CGraph::InArcIt | Iterator class for the incoming arcs of a node |
CGraph::OutArcIt | Iterator class for the outgoing arcs of a node |
►CDigraph::Arc | The arc type of the digraph |
CDigraph::ArcIt | Iterator class for the arcs |
CDigraph::InArcIt | Iterator class for the incoming arcs of a node |
CDigraph::OutArcIt | Iterator class for the outgoing arcs of a node |
CPath< GR >::ArcIt | LEMON style iterator for enumerating the arcs of a path |
CPathDumper< GR >::ArcIt | LEMON style iterator for enumerating the arcs of a path |
CPath< GR >::ArcIt | LEMON style iterator for path arcs |
CSimplePath< GR >::ArcIt | Iterator class to iterate on the arcs of the paths |
CListPath< GR >::ArcIt | Iterator class to iterate on the arcs of the paths |
CStaticPath< GR >::ArcIt | Iterator class to iterate on the arcs of the paths |
►CArcLookUp< GR > | Fast arc look-up between given endpoints |
CAllArcLookUp< GR > | Fast look-up of all arcs between given endpoints |
CArgParser | Command line arguments parser |
CBackwardMap< GR > | Map of the "backward" directed arc view of edges in a graph |
►CBaseDigraphComponent | Base skeleton class for directed graphs |
CAlterableDigraphComponent< BAS > | Skeleton class for alterable directed graphs |
►CBaseGraphComponent | Base skeleton class for undirected graphs |
►CAlterableDigraphComponent< BaseGraphComponent > | |
CAlterableGraphComponent< BAS > | Skeleton class for alterable undirected graphs |
►CClearableDigraphComponent< BaseGraphComponent > | |
CClearableGraphComponent< BAS > | Skeleton class for clearable undirected graphs |
►CIDableDigraphComponent< BaseGraphComponent > | |
CIDableGraphComponent< BAS > | Skeleton class for idable undirected graphs |
►CIterableDigraphComponent< BaseGraphComponent > | |
CIterableGraphComponent< BAS > | Skeleton class for iterable undirected graphs |
►CBaseBpGraphComponent | Base skeleton class for undirected bipartite graphs |
►CAlterableDigraphComponent< BaseBpGraphComponent > | |
►CAlterableGraphComponent< BaseBpGraphComponent > | |
CAlterableBpGraphComponent< BAS > | Skeleton class for alterable undirected bipartite graphs |
►CClearableDigraphComponent< BaseBpGraphComponent > | |
►CClearableGraphComponent< BaseBpGraphComponent > | |
CClearableBpGraphComponent< BAS > | Skeleton class for clearable undirected biparite graphs |
►CErasableGraphComponent< BaseBpGraphComponent > | |
CErasableBpGraphComponent< BAS > | Skeleton class for erasable undirected graphs |
►CIDableDigraphComponent< BaseBpGraphComponent > | |
►CIDableGraphComponent< BaseBpGraphComponent > | |
CIDableBpGraphComponent< BAS > | Skeleton class for idable undirected bipartite graphs |
►CIterableDigraphComponent< BaseBpGraphComponent > | |
►CIterableGraphComponent< BaseBpGraphComponent > | |
CIterableBpGraphComponent< BAS > | Skeleton class for iterable undirected bipartite graphs |
CExtendableBpGraphComponent< BAS > | Skeleton class for extendable undirected bipartite graphs |
►CMappableDigraphComponent< BaseBpGraphComponent > | |
►CMappableGraphComponent< BaseBpGraphComponent > | |
CMappableBpGraphComponent< BAS > | Skeleton class for mappable undirected bipartite graphs |
CErasableGraphComponent< BAS > | Skeleton class for erasable undirected graphs |
CExtendableGraphComponent< BAS > | Skeleton class for extendable undirected graphs |
►CMappableDigraphComponent< BaseGraphComponent > | |
CMappableGraphComponent< BAS > | Skeleton class for mappable undirected graphs |
CClearableDigraphComponent< BAS > | Skeleton class for clearable directed graphs |
CErasableDigraphComponent< BAS > | Skeleton class for erasable directed graphs |
CExtendableDigraphComponent< BAS > | Skeleton class for extendable directed graphs |
CIDableDigraphComponent< BAS > | Skeleton class for idable directed graphs |
CIterableDigraphComponent< BAS > | Skeleton class for iterable directed graphs |
CMappableDigraphComponent< BAS > | Skeleton class for mappable directed graphs |
CBellmanFord< GR, LEN, TR > | BellmanFord algorithm class |
►CBellmanFord< Digraph, LengthMap, SetDistMapTraits< T > > | |
CBellmanFord< GR, LEN, TR >::SetDistMap< T > | Named parameter for setting DistMap type |
►CBellmanFord< Digraph, LengthMap, SetOperationTraitsTraits< T > > | |
CBellmanFord< GR, LEN, TR >::SetOperationTraits< T > | Named parameter for setting OperationTraits type |
►CBellmanFord< Digraph, LengthMap, SetPredMapTraits< T > > | |
CBellmanFord< GR, LEN, TR >::SetPredMap< T > | Named parameter for setting PredMap type |
CBellmanFordDefaultOperationTraits< V, has_inf > | Default OperationTraits for the BellmanFord algorithm class |
CBellmanFordDefaultTraits< GR, LEN > | Default traits class of BellmanFord class |
CBellmanFordWizard< TR > | Auxiliary class for the function-type interface of the Bellman-Ford algorithm |
►CBellmanFordWizardDefaultTraits< GR, LEN > | Default traits class of bellmanFord() function |
CBellmanFordWizardBase< GR, LEN > | Default traits class used by BellmanFordWizard |
CBfs< GR, TR > | BFS algorithm class |
►CBfs< Digraph, SetDistMapTraits< T > > | |
CBfs< GR, TR >::SetDistMap< T > | Named parameter for setting DistMap type |
►CBfs< Digraph, SetPredMapTraits< T > > | |
CBfs< GR, TR >::SetPredMap< T > | Named parameter for setting PredMap type |
►CBfs< Digraph, SetProcessedMapTraits< T > > | |
CBfs< GR, TR >::SetProcessedMap< T > | Named parameter for setting ProcessedMap type |
►CBfs< Digraph, SetReachedMapTraits< T > > | |
CBfs< GR, TR >::SetReachedMap< T > | Named parameter for setting ReachedMap type |
►CBfs< Digraph, SetStandardProcessedMapTraits > | |
CBfs< GR, TR >::SetStandardProcessedMap | Named parameter for setting ProcessedMap type to be Digraph::NodeMap<bool> |
CBfsDefaultTraits< GR > | Default traits class of Bfs class |
CBfsVisit< GR, VS, TR > | BFS algorithm class with visitor interface |
►CBfsVisit< Digraph, Visitor, SetReachedMapTraits< T > > | |
CBfsVisit< GR, VS, TR >::SetReachedMap< T > | Named parameter for setting ReachedMap type |
CBfsVisitDefaultTraits< GR > | Default traits class of BfsVisit class |
CBfsVisitor< GR > | Visitor class for BFS |
CBfsVisitor< Digraph > | |
CBfsWizard< TR > | Auxiliary class for the function-type interface of BFS algorithm |
►CBfsWizardDefaultTraits< GR > | Default traits class of bfs() function |
CBfsWizardBase< GR > | Default traits class used by BfsWizard |
CBinHeap< PR, IM, CMP > | Binary heap data structure |
CBinHeap< Value, IntArcMap > | |
CBinHeap< Value, IntEdgeMap > | |
CBinHeap< Value, IntNodeMap > | |
CBinHeap< Value, lemon::RangeMap > | |
CBinomialHeap< PR, IM, CMP > | Binomial heap data structure |
CMaxWeightedMatching< GR, WM >::BlossomIt | Iterator for obtaining the nodes of a blossom |
CMaxWeightedPerfectMatching< GR, WM >::BlossomIt | Iterator for obtaining the nodes of a blossom |
CBox< T > | Bounding box of plain vectors (points) |
CBpGraph | Class describing the concept of undirected bipartite graphs |
CBpGraphCopy< From, To > | Class to copy a bipartite graph |
CBpGraphReader< BGR > | LGF reader for bipartite graphs |
CBpGraphWriter< BGR > | LGF writer for undirected bipartite graphs |
CBucketHeap< IM, MIN > | Bucket heap data structure |
CCapacityScaling< GR, V, C, TR > | Implementation of the Capacity Scaling algorithm for finding a minimum cost flow |
►CCapacityScaling< GR, V, C, SetHeapTraits< T > > | |
CCapacityScaling< GR, V, C, TR >::SetHeap< T > | Named parameter for setting Heap type |
CCapacityScalingDefaultTraits< GR, V, C > | Default traits class of CapacityScaling algorithm |
CChristofidesTsp< CM > | Christofides algorithm for symmetric TSP |
CCirculation< GR, LM, UM, SM, TR > | Push-relabel algorithm for the network circulation problem |
►CCirculation< Digraph, LowerMap, UpperMap, SupplyMap, SetElevatorTraits< T > > | |
CCirculation< GR, LM, UM, SM, TR >::SetElevator< T > | Named parameter for setting Elevator type |
►CCirculation< Digraph, LowerMap, UpperMap, SupplyMap, SetFlowMapTraits< T > > | |
CCirculation< GR, LM, UM, SM, TR >::SetFlowMap< T > | Named parameter for setting FlowMap type |
►CCirculation< Digraph, LowerMap, UpperMap, SupplyMap, SetStandardElevatorTraits< T > > | |
CCirculation< GR, LM, UM, SM, TR >::SetStandardElevator< T > | Named parameter for setting Elevator type with automatic allocation |
CCirculationDefaultTraits< GR, LM, UM, SM > | Default traits class of Circulation class |
CUnionFindEnum< IM >::ClassIt | LEMON style iterator for the representant items |
CExtendFindEnum< IM >::ClassIt | LEMON style iterator for the classes |
CHeapUnionFind< V, IM, Comp >::ClassIt | Class iterator |
CGrossoLocatelliPullanMc< GR >::CliqueNodeIt | Iterator to list the nodes of the found clique |
CLpBase::Expr::CoeffIt | Iterator over the expression |
CLpBase::DualExpr::CoeffIt | Iterator over the expression |
►CLpBase::Col | Refer to a column of the LP |
CLpBase::ColIt | Iterator for iterate over the columns of an LP problem |
CGridGraph::ColMap | Map to get the column of the nodes |
CColor | Data structure representing RGB colors |
CSplitNodes< DGR >::CombinedArcMap< AM, NM > | Arc map combined from an arc map and a node map of the original digraph |
CUndirector< DGR >::CombinedArcMap< FW, BK > | Arc map combined from two original arc maps |
CSplitNodes< DGR >::CombinedNodeMap< IN, OUT > | Node map combined from two original node maps |
CConArcIt< GR > | Iterator for iterating on parallel arcs connecting the same nodes |
CConEdgeIt< GR > | Iterator for iterating on parallel edges connecting the same nodes |
CLpBase::Expr::ConstCoeffIt | Const iterator over the expression |
CLpBase::DualExpr::ConstCoeffIt | Iterator over the expression |
CLpBase::Constr | Linear constraint |
CConstXMap< M > | Constant (read only) version of XMap |
CConstYMap< M > | Constant (read only) version of YMap |
CCostScaling< GR, V, C, TR > | Implementation of the Cost Scaling algorithm for finding a minimum cost flow |
►CCostScaling< GR, V, C, SetLargeCostTraits< T > > | |
CCostScaling< GR, V, C, TR >::SetLargeCost< T > | Named parameter for setting LargeCost type |
CCostScalingDefaultTraits< GR, V, C > | Default traits class of CostScaling algorithm |
CCounter | A counter class |
CCplexEnv | Reference counted wrapper around cpxenv pointer |
CCrossRefMap< GR, K, V > | General cross reference graph map type |
CCycleCanceling< GR, V, C > | Implementation of cycle-canceling algorithms for finding a minimum cost flow |
CDefaultGraphToEpsTraits< GR > | Default traits class of GraphToEps |
CDfs< GR, TR > | DFS algorithm class |
►CDfs< Digraph, SetDistMapTraits< T > > | |
CDfs< GR, TR >::SetDistMap< T > | Named parameter for setting DistMap type |
►CDfs< Digraph, SetPredMapTraits< T > > | |
CDfs< GR, TR >::SetPredMap< T > | Named parameter for setting PredMap type |
►CDfs< Digraph, SetProcessedMapTraits< T > > | |
CDfs< GR, TR >::SetProcessedMap< T > | Named parameter for setting ProcessedMap type |
►CDfs< Digraph, SetReachedMapTraits< T > > | |
CDfs< GR, TR >::SetReachedMap< T > | Named parameter for setting ReachedMap type |
►CDfs< Digraph, SetStandardProcessedMapTraits > | |
CDfs< GR, TR >::SetStandardProcessedMap | Named parameter for setting ProcessedMap type to be Digraph::NodeMap<bool> |
CDfsDefaultTraits< GR > | Default traits class of Dfs class |
CDfsVisit< GR, VS, TR > | DFS algorithm class with visitor interface |
►CDfsVisit< Digraph, Visitor, SetReachedMapTraits< T > > | |
CDfsVisit< GR, VS, TR >::SetReachedMap< T > | Named parameter for setting ReachedMap type |
CDfsVisitDefaultTraits< GR > | Default traits class of DfsVisit class |
CDfsVisitor< GR > | Visitor class for DFS |
CDfsVisitor< Digraph > | |
CDfsVisitor< Graph > | |
CDfsWizard< TR > | Auxiliary class for the function-type interface of DFS algorithm |
►CDfsWizardDefaultTraits< GR > | Default traits class of dfs() function |
CDfsWizardBase< GR > | Default traits class used by DfsWizard |
CDHeap< PR, IM, D, CMP > | D-ary heap data structure |
CDiEulerIt< GR > | Euler tour iterator for digraphs |
CDigraph | Class describing the concept of directed graphs |
CDigraphCopy< From, To > | Class to copy a digraph |
CDigraphReader< DGR > | LGF reader for directed graphs |
CDigraphWriter< DGR > | LGF writer for directed graphs |
CDijkstra< GR, LEN, TR > | Dijkstra algorithm class |
►CDijkstra< Digraph, LengthMap, SetDistMapTraits< T > > | |
CDijkstra< GR, LEN, TR >::SetDistMap< T > | Named parameter for setting DistMap type |
►CDijkstra< Digraph, LengthMap, SetHeapTraits< H, typename Digraph::template NodeMap< int > > > | |
CDijkstra< GR, LEN, TR >::SetHeap< H, CR > | Named parameter for setting heap and cross reference types |
►CDijkstra< Digraph, LengthMap, SetOperationTraitsTraits< T > > | |
CDijkstra< GR, LEN, TR >::SetOperationTraits< T > | Named parameter for setting OperationTraits type |
►CDijkstra< Digraph, LengthMap, SetPredMapTraits< T > > | |
CDijkstra< GR, LEN, TR >::SetPredMap< T > | Named parameter for setting PredMap type |
►CDijkstra< Digraph, LengthMap, SetProcessedMapTraits< T > > | |
CDijkstra< GR, LEN, TR >::SetProcessedMap< T > | Named parameter for setting ProcessedMap type |
►CDijkstra< Digraph, LengthMap, SetStandardHeapTraits< H, typename Digraph::template NodeMap< int > > > | |
CDijkstra< GR, LEN, TR >::SetStandardHeap< H, CR > | Named parameter for setting heap and cross reference types with automatic allocation |
►CDijkstra< Digraph, LengthMap, SetStandardProcessedMapTraits > | |
CDijkstra< GR, LEN, TR >::SetStandardProcessedMap | Named parameter for setting ProcessedMap type to be Digraph::NodeMap<bool> |
CDijkstraDefaultOperationTraits< V > | Default operation traits for the Dijkstra algorithm class |
CDijkstraDefaultTraits< GR, LEN > | Default traits class of Dijkstra class |
CDijkstraWizard< TR > | Auxiliary class for the function-type interface of Dijkstra algorithm |
►CDijkstraWizardDefaultTraits< GR, LEN > | Default traits class of dijkstra() function |
CDijkstraWizardBase< GR, LEN > | Default traits class used by DijkstraWizard |
CDimacsDescriptor | DIMACS file type descriptor |
CLpBase::DualExpr | Linear expression of rows |
CMinCostArborescence< GR, CM, TR >::DualIt | LEMON iterator for getting a dual variable |
CDynArcLookUp< GR > | Dynamic arc look-up between given endpoints |
►CBpGraph::Edge | The edge type of the graph |
CBpGraph::EdgeIt | Iterator class for the edges |
CBpGraph::IncEdgeIt | Iterator class for the incident edges of a node |
►CGraph::Edge | The edge type of the graph |
CGraph::EdgeIt | Iterator class for the edges |
CGraph::IncEdgeIt | Iterator class for the incident edges of a node |
CEdmondsKarp< GR, CAP, TR > | Edmonds-Karp algorithms class |
►CEdmondsKarp< Digraph, CapacityMap, SetFlowMapTraits< T > > | |
CEdmondsKarp< GR, CAP, TR >::SetFlowMap< T > | Named parameter for setting FlowMap type |
CEdmondsKarpDefaultTraits< GR, CAP > | Default traits class of EdmondsKarp class |
CElevator< GR, Item > | Class for handling "labels" in push-relabel type algorithms |
CEulerIt< GR > | Euler tour iterator for graphs |
►Cexception | STL class |
►CException | Generic exception class |
CArgParserException | Exception used by ArgParser |
CCplexEnv::LicenseError | This exception is thrown when the license check is not sufficient |
CFormatError | Format error |
CIoError | Input-Output error |
CLpBase::UnsupportedFormatError | Unsupported file format exception |
CRadixHeap< IM >::PriorityUnderflowError | Exception thrown by RadixHeap |
CLpBase::Expr | Linear expression of variables and a constant component |
CExtendFindEnum< IM > | A Extend-Find data structure implementation which is able to enumerate the components |
CIterableBoolMap< GR, K >::FalseIt | Iterator for the keys mapped to false |
CFibHeap< PR, IM, CMP > | Fibonacci heap data structure |
CFilterArcs< DGR, AF > | Adaptor class for hiding arcs in a digraph |
CFilterEdges< GR, EF > | Adaptor class for hiding edges in a graph |
CFilterNodes< GR, NF > | Adaptor class for hiding nodes in a digraph or a graph |
CForwardMap< GR > | Map of the "forward" directed arc view of edges in a graph |
CFullBpGraph | An undirected full bipartite graph class |
CFullDigraph | A directed full graph class |
CFullGraph | An undirected full graph class |
CGomoryHu< GR, CAP > | Gomory-Hu cut tree algorithm |
CGraph | Class describing the concept of undirected graphs |
CGraphCopy< From, To > | Class to copy a graph |
CGraphIncIt< GR, Item, Base, sel > | Concept class for InArcIt , OutArcIt and IncEdgeIt types |
►CGraphItem | Concept class for Node , Arc and Edge types |
CBaseBpGraphComponent::BlueNode | Class to represent blue nodes |
CBaseBpGraphComponent::RedNode | Class to represent red nodes |
►CGraphItem< 'e'> | |
CBaseGraphComponent::Edge | Undirected edge class of the graph |
CGraphItemIt< GR, Item > | Concept class for NodeIt , ArcIt and EdgeIt types |
CGraphReader< GR > | LGF reader for undirected graphs |
CGraphToEps< T > | Auxiliary class to implement the named parameters of graphToEps() |
CGraphWriter< GR > | LGF writer for undirected graphs |
CGreedyTsp< CM > | Greedy algorithm for symmetric TSP |
CGridGraph | Grid graph class |
CGrossoLocatelliPullanMc< GR > | Implementation of the iterated local search algorithm of Grosso, Locatelli, and Pullan for the maximum clique problem |
CHaoOrlin< GR, CAP, TOL > | Hao-Orlin algorithm for finding a minimum cut in a digraph |
CHartmannOrlinMmc< GR, CM, TR > | Implementation of the Hartmann-Orlin algorithm for finding a minimum mean cycle |
►CHartmannOrlinMmc< GR, CM, SetLargeCostTraits< T > > | |
CHartmannOrlinMmc< GR, CM, TR >::SetLargeCost< T > | Named parameter for setting LargeCost type |
►CHartmannOrlinMmc< GR, CM, SetPathTraits< T > > | |
CHartmannOrlinMmc< GR, CM, TR >::SetPath< T > | Named parameter for setting Path type |
CHartmannOrlinMmcDefaultTraits< GR, CM > | Default traits class of HartmannOrlinMmc class |
CHeap< PR, IM, CMP > | The heap concept |
CHeapUnionFind< V, IM, Comp > | A Union-Find data structure implementation which is able to store a priority for each item and retrieve the minimum of each class |
CHowardMmc< GR, CM, TR > | Implementation of Howard's algorithm for finding a minimum mean cycle |
►CHowardMmc< GR, CM, SetLargeCostTraits< T > > | |
CHowardMmc< GR, CM, TR >::SetLargeCost< T > | Named parameter for setting LargeCost type |
►CHowardMmc< GR, CM, SetPathTraits< T > > | |
CHowardMmc< GR, CM, TR >::SetPath< T > | Named parameter for setting Path type |
CHowardMmcDefaultTraits< GR, CM > | Default traits class of HowardMmc class |
CHypercubeGraph | Hypercube graph class |
CHypercubeGraph::HyperMap< T, BF > | Linear combination map |
CInDegMap< GR > | Map of the in-degrees of nodes in a digraph |
CGridGraph::IndexMap | Map to get the indices of the nodes as dim2::Point<int> |
CInsertionTsp< CM > | Insertion algorithm for symmetric TSP |
CInvalid | Dummy type to make it easier to create invalid iterators |
CIdMap< GR, K >::InverseMap | The inverse map type of IdMap |
CCrossRefMap< GR, K, V >::InverseMap | The inverse map type of CrossRefMap |
CRangeIdMap< GR, K >::InverseMap | The inverse map type of RangeIdMap |
CIterableIntMap< GR, K >::ItemIt | Iterator for the keys with the same value |
CIterableValueMap< GR, K, V >::ItemIt | Iterator for the keys with the same value |
CIterableBoolMap< GR, K >::ItemIt | Iterator for the keys mapped to a given value |
CUnionFindEnum< IM >::ItemIt | LEMON style iterator for the items of a component |
CExtendFindEnum< IM >::ItemIt | LEMON style iterator for the items of a component |
CHeapUnionFind< V, IM, Comp >::ItemIt | LEMON style iterator for the items of a class |
CIterableBoolMap< GR, K > | Dynamic iterable bool map |
CIterableIntMap< GR, K > | Dynamic iterable integer map |
CIterableValueMap< GR, K, V > | Dynamic iterable map for comparable values |
CKarpMmc< GR, CM, TR > | Implementation of Karp's algorithm for finding a minimum mean cycle |
►CKarpMmc< GR, CM, SetLargeCostTraits< T > > | |
CKarpMmc< GR, CM, TR >::SetLargeCost< T > | Named parameter for setting LargeCost type |
►CKarpMmc< GR, CM, SetPathTraits< T > > | |
CKarpMmc< GR, CM, TR >::SetPath< T > | Named parameter for setting Path type |
CKarpMmcDefaultTraits< GR, CM > | Default traits class of KarpMmc class |
CLgfContents | Reader for the contents of the LGF file |
CLinkedElevator< GR, Item > | Class for handling "labels" in push-relabel type algorithms |
CListArcSet< GR > | Digraph using a node set of another digraph or graph and an own arc set |
CListBpGraph | A general undirected graph structure |
CListDigraph | A general directed graph structure |
CListEdgeSet< GR > | Graph using a node set of another digraph or graph and an own edge set |
CListGraph | A general undirected graph structure |
CListPath< GR > | A structure for representing directed paths in a digraph |
►CLpBase | Common base class for LP and MIP solvers |
►CCplexBase | Base interface for the CPLEX LP and MIP solver |
CCplexLp | Interface for the CPLEX LP solver |
CCplexMip | Interface for the CPLEX MIP solver |
►CGlpkBase | Base interface for the GLPK LP and MIP solver |
CGlpkLp | Interface for the GLPK LP solver |
CGlpkMip | Interface for the GLPK MIP solver |
►CLpSolver | Common base class for LP solvers |
CClpLp | Interface for the CLP solver |
CCplexLp | Interface for the CPLEX LP solver |
CGlpkLp | Interface for the GLPK LP solver |
CLpSkeleton | Skeleton class for an LP solver interface |
CSoplexLp | Interface for the SOPLEX solver |
►CMipSolver | Common base class for MIP solvers |
CCbcMip | Interface for the CBC MIP solver |
CCplexMip | Interface for the CPLEX MIP solver |
CGlpkMip | Interface for the GLPK MIP solver |
CMipSkeleton | Skeleton class for a MIP solver interface |
►CSkeletonSolverBase | A skeleton class to implement LP/MIP solver base interface |
CLpSkeleton | Skeleton class for an LP solver interface |
CMipSkeleton | Skeleton class for a MIP solver interface |
►CMapBase< K, V > | Base class of maps |
CConstMap< K, V > | Constant map |
CConstMap< K, Const< V, v > > | Constant map with inlined constant value |
CNullMap< K, V > | Null map. (a.k.a. DoNothingMap) |
CSparseMap< K, V, Comp > | Map type based on std::map |
►CMapBase< GR::Edge, Const< bool, true > > | |
CConstMap< GR::Edge, Const< bool, true > > | |
►CMapBase< int, BlossomData > | |
CRangeMap< BlossomData > | |
►CMapBase< int, Color > | |
CPalette | Map int s to different Color s |
►CMapBase< int, NodeData > | |
CRangeMap< NodeData > | |
►CMapBase< int, V > | |
CRangeMap< V > | Map for storing values for integer keys from the range [0..size-1] |
►CMapBase< K, bool > | |
CFalseMap< K > | Constant false map |
CTrueMap< K > | Constant true map |
►CMapBase< K, int > | |
CIdMap< GR, K > | Provides an immutable and unique id for each item in a graph |
►CMapBase< KEY, bool > | |
CLoggerBoolMap< IT, KEY > | Writable bool map for logging each true assigned element |
►CMapBase< M1::Key, bool > | |
CAndMap< M1, M2 > | Logical 'and' of two maps |
CEqualMap< M1, M2 > | Combination of two maps using the == operator |
CLessMap< M1, M2 > | Combination of two maps using the < operator |
COrMap< M1, M2 > | Logical 'or' of two maps |
►CMapBase< M1::Key, M1::Value > | |
CAddMap< M1, M2 > | Sum of two maps |
CDivMap< M1, M2 > | Quotient of two maps |
CForkMap< M1, M2 > | Applies all map setting operations to two maps |
CMulMap< M1, M2 > | Product of two maps |
CSubMap< M1, M2 > | Difference of two maps |
►CMapBase< M1::Key, typename F::result_type > | |
CCombineMap< M1, M2, F, V > | Combination of two maps using an STL (binary) functor |
►CMapBase< M2::Key, M1::Value > | |
CComposeMap< M1, M2 > | Composition of two maps |
►CMapBase< M::Key, bool > | |
CNotMap< M > | Logical 'not' of a map |
CNotWriteMap< M > | Logical 'not' of a map (read-write version) |
►CMapBase< M::Key, M::Value > | |
CAbsMap< M > | Absolute value of a map |
CMapToFunctor< M > | Converts a map to an STL style (unary) functor |
CNegMap< M > | Negative of a map |
CNegWriteMap< M > | Negative of a map (read-write version) |
CScaleMap< M, C > | Scales a map with a constant |
CScaleWriteMap< M, C > | Scales a map with a constant (read-write version) |
CShiftMap< M, C > | Shifts a map with a constant |
CShiftWriteMap< M, C > | Shifts a map with a constant (read-write version) |
►CMapBase< M::Key, V > | |
CConvertMap< M, V > | Map adaptor to convert the Value type of a map to another type using the default conversion |
►CMapBase< T, T > | |
CIdentityMap< T > | Identity map |
►CMapBase< typename DGR::Node, Const< bool, true > > | |
CConstMap< typename DGR::Node, Const< bool, true > > | |
►CMapBase< typename Digraph::Arc, Const< bool, true > > | |
CConstMap< typename Digraph::Arc, Const< bool, true > > | |
►CMapBase< typename F::argument_type, typename F::result_type > | |
CFunctorToMap< F, K, V > | Converts an STL style (unary) functor to a map |
►CMapBase< typename GR::Edge, Const< bool, true > > | |
CConstMap< typename GR::Edge, Const< bool, true > > | |
►CMapBase< typename GR::Node, Const< bool, true > > | |
CConstMap< typename GR::Node, Const< bool, true > > | |
►CMapBase< typename Graph::Arc, double > | |
CConstMap< typename Graph::Arc, double > | |
►CMapBase< typename Graph::Arc, lemon::Color > | |
CConstMap< typename Graph::Arc, lemon::Color > | |
►CMapBase< typename Graph::Node, bool > | |
CConstMap< typename Graph::Node, bool > | |
►CMapBase< typename Graph::Node, dim2::Point< double > > | |
CConstMap< typename Graph::Node, dim2::Point< double > > | |
►CMapBase< typename Graph::Node, double > | |
CConstMap< typename Graph::Node, double > | |
►CMapBase< typename Graph::Node, int > | |
CConstMap< typename Graph::Node, int > | |
►CMapBase< typename Graph::Node, lemon::Color > | |
CConstMap< typename Graph::Node, lemon::Color > | |
CMaxCardinalitySearch< GR, CAP, TR > | Maximum Cardinality Search algorithm class |
►CMaxCardinalitySearch< Digraph, CapacityMap, DefCapacityMapTraits< T > > | |
CMaxCardinalitySearch< GR, CAP, TR >::SetCapacityMap< T > | Named parameter for setting CapacityMap type |
►CMaxCardinalitySearch< Digraph, CapacityMap, DefCardinalityMapTraits< T > > | |
CMaxCardinalitySearch< GR, CAP, TR >::SetCardinalityMap< T > | Named parameter for setting CardinalityMap type |
►CMaxCardinalitySearch< Digraph, CapacityMap, DefHeapTraits< H, typename Digraph::template NodeMap< int > > > | |
CMaxCardinalitySearch< GR, CAP, TR >::SetHeap< H, CR > | Named parameter for setting heap and cross reference type |
►CMaxCardinalitySearch< Digraph, CapacityMap, DefProcessedMapTraits< T > > | |
CMaxCardinalitySearch< GR, CAP, TR >::SetProcessedMap< T > | Named parameter for setting ProcessedMap type |
►CMaxCardinalitySearch< Digraph, CapacityMap, DefStandardHeapTraits< H, typename Digraph::template NodeMap< int > > > | |
CMaxCardinalitySearch< GR, CAP, TR >::SetStandardHeap< H, CR > | Named parameter for setting heap and cross reference type with automatic allocation |
CMaxCardinalitySearchDefaultTraits< GR, CAP > | Default traits class of MaxCardinalitySearch class |
CMaxFractionalMatching< GR, TR > | Max cardinality fractional matching |
►CMaxFractionalMatching< Graph, SetElevatorTraits< T > > | |
CMaxFractionalMatching< GR, TR >::SetElevator< T > | Named parameter for setting Elevator type |
►CMaxFractionalMatching< Graph, SetMatchingMapTraits< T > > | |
CMaxFractionalMatching< GR, TR >::SetMatchingMap< T > | Named parameter for setting MatchingMap type |
►CMaxFractionalMatching< Graph, SetStandardElevatorTraits< T > > | |
CMaxFractionalMatching< GR, TR >::SetStandardElevator< T > | Named parameter for setting Elevator type with automatic allocation |
CMaxFractionalMatchingDefaultTraits< GR > | Default traits class of MaxFractionalMatching class |
CMaxMatching< GR > | Maximum cardinality matching in general graphs |
CMaxWeightedFractionalMatching< GR, WM > | Weighted fractional matching in general graphs |
CMaxWeightedMatching< GR, WM > | Weighted matching in general graphs |
CMaxWeightedPerfectFractionalMatching< GR, WM > | Weighted fractional perfect matching in general graphs |
CMaxWeightedPerfectMatching< GR, WM > | Weighted perfect matching in general graphs |
CMinCostArborescence< GR, CM, TR > | Minimum Cost Arborescence algorithm class |
►CMinCostArborescence< Digraph, CostMap, SetArborescenceMapTraits< T > > | |
CMinCostArborescence< GR, CM, TR >::SetArborescenceMap< T > | Named parameter for setting ArborescenceMap type |
►CMinCostArborescence< Digraph, CostMap, SetPredMapTraits< T > > | |
CMinCostArborescence< GR, CM, TR >::SetPredMap< T > | Named parameter for setting PredMap type |
CMinCostArborescenceDefaultTraits< GR, CM > | Default traits class for MinCostArborescence class |
CGomoryHu< GR, CAP >::MinCutEdgeIt | Iterate on the edges of a minimum cut |
CGomoryHu< GR, CAP >::MinCutNodeIt | Iterate on the nodes of a minimum cut |
CNagamochiIbaraki< GR, CM, TR > | Calculates the minimum cut in an undirected graph |
►CNagamochiIbaraki< Graph, CapacityMap, SetHeapTraits< H, RangeMap< int > > > | |
CNagamochiIbaraki< GR, CM, TR >::SetHeap< H, CR > | Named parameter for setting heap and cross reference type |
►CNagamochiIbaraki< Graph, CapacityMap, SetStandardHeapTraits< H, RangeMap< int > > > | |
CNagamochiIbaraki< GR, CM, TR >::SetStandardHeap< H, CR > | Named parameter for setting heap and cross reference type with automatic allocation |
►CNagamochiIbaraki< Graph, CapacityMap, SetUnitCapacityTraits > | |
CNagamochiIbaraki< GR, CM, TR >::SetUnitCapacity | Named parameter for setting the capacity map to a constMap<Edge, int, 1>() instance |
CNagamochiIbarakiDefaultTraits< GR, CM > | Default traits class for NagamochiIbaraki class |
CNearestNeighborTsp< CM > | Nearest neighbor algorithm for symmetric TSP |
CNetworkSimplex< GR, V, C > | Implementation of the primal Network Simplex algorithm for finding a minimum cost flow |
CNoCounter | 'Do nothing' version of Counter |
►CBpGraph::Node | The node type of the graph |
►CBpGraph::BlueNode | Class to represent blue nodes |
CBpGraph::BlueNodeIt | Iterator class for the blue nodes |
CBpGraph::NodeIt | Iterator class for the nodes |
►CBpGraph::RedNode | Class to represent red nodes |
CBpGraph::RedNodeIt | Iterator class for the red nodes |
►CDigraph::Node | The node type of the digraph |
CDigraph::NodeIt | Iterator class for the nodes |
►CGraph::Node | The node type of the graph |
CGraph::NodeIt | Iterator class for the nodes |
CNormSquareMap< M > | Map of the normSquare() of a Point -map |
CNoTimeReport | 'Do nothing' version of TimeReport |
COpt2Tsp< CM > | 2-opt algorithm for symmetric TSP |
COrienter< GR, DM > | Adaptor class for orienting the edges of a graph to get a digraph |
COutDegMap< GR > | Map of the out-degrees of nodes in a digraph |
CPairingHeap< PR, IM, CMP > | Pairing Heap |
CPath< GR > | A skeleton structure for representing directed paths in a digraph |
CPath< GR > | A structure for representing directed paths in a digraph |
CPathDumper< GR > | A skeleton structure for path dumpers |
CPathNodeIt< Path > | Class which helps to iterate through the nodes of a path |
CPlanarColoring< Graph > | Coloring planar graphs |
CPlanarDrawing< Graph > | Schnyder's planar drawing algorithm |
CPlanarEmbedding< Graph > | Planar embedding of an undirected simple graph |
CPoint< T > | Two dimensional vector (plain vector) |
CPoint< double > | |
CPotentialDifferenceMap< GR, POT > | Potential difference map |
CPreflow< GR, CAP, TR > | Preflow algorithm class |
►CPreflow< Digraph, CapacityMap, SetElevatorTraits< T > > | |
CPreflow< GR, CAP, TR >::SetElevator< T > | Named parameter for setting Elevator type |
►CPreflow< Digraph, CapacityMap, SetFlowMapTraits< T > > | |
CPreflow< GR, CAP, TR >::SetFlowMap< T > | Named parameter for setting FlowMap type |
►CPreflow< Digraph, CapacityMap, SetStandardElevatorTraits< T > > | |
CPreflow< GR, CAP, TR >::SetStandardElevator< T > | Named parameter for setting Elevator type with automatic allocation |
CPreflowDefaultTraits< GR, CAP > | Default traits class of Preflow class |
CQuadHeap< PR, IM, CMP > | Fourary (quaternary) heap data structure |
CRadixHeap< IM > | Radix heap data structure |
CRandom | Mersenne Twister random number generator |
CRangeIdMap< GR, K > | Provides continuous and unique id for the items of a graph |
►CReadMap< K, T > | Readable map concept |
►CReadWriteMap< K, T > | Read/writable map concept |
CReferenceMap< K, T, R, CR > | Dereferable map concept |
►CReadMap< Arc, T > | |
►CReadWriteMap< Arc, T > | |
►CReferenceMap< Arc, T, T &, const T & > | |
CBpGraph::ArcMap< T > | Standard graph map type for the arcs |
CDigraph::ArcMap< T > | Standard graph map type for the arcs |
CGraph::ArcMap< T > | Standard graph map type for the arcs |
►CReadMap< Arc, V > | |
►CReadWriteMap< Arc, V > | |
►CReferenceMap< Arc, V, V &, const V & > | |
►CGraphMap< MappableDigraphComponent, Arc, V > | |
CMappableDigraphComponent< BAS >::ArcMap< V > | Standard graph map for the arcs |
►CReadMap< Edge, T > | |
►CReadWriteMap< Edge, T > | |
►CReferenceMap< Edge, T, T &, const T & > | |
CBpGraph::EdgeMap< T > | Standard graph map type for the edges |
CGraph::EdgeMap< T > | Standard graph map type for the edges |
►CReadMap< Edge, V > | |
►CReadWriteMap< Edge, V > | |
►CReferenceMap< Edge, V, V &, const V & > | |
►CGraphMap< MappableGraphComponent, Edge, V > | |
CMappableGraphComponent< BAS >::EdgeMap< V > | Standard graph map for the edges |
►CReadMap< K, V > | |
►CReadWriteMap< K, V > | |
►CReferenceMap< K, V, V &, const V & > | |
CGraphMap< GR, K, V > | Concept class for standard graph maps |
►CReadMap< Node, T > | |
►CReadWriteMap< Node, T > | |
►CReferenceMap< Node, T, T &, const T & > | |
CBpGraph::BlueNodeMap< T > | Standard graph map type for the blue nodes |
CBpGraph::NodeMap< T > | Standard graph map type for the nodes |
CBpGraph::RedNodeMap< T > | Standard graph map type for the red nodes |
CDigraph::NodeMap< T > | Standard graph map type for the nodes |
CGraph::NodeMap< T > | Standard graph map type for the nodes |
►CReadMap< Node, V > | |
►CReadWriteMap< Node, V > | |
►CReferenceMap< Node, V, V &, const V & > | |
►CGraphMap< MappableBpGraphComponent, Node, V > | |
CMappableBpGraphComponent< BAS >::BlueNodeMap< V > | Standard graph map for the blue nodes |
CMappableBpGraphComponent< BAS >::RedNodeMap< V > | Standard graph map for the red nodes |
►CGraphMap< MappableDigraphComponent, Node, V > | |
CMappableDigraphComponent< BAS >::NodeMap< V > | Standard graph map for the nodes |
CIterableBoolMap< GR, K >::Reference | Reference to the value of the map |
CIterableIntMap< GR, K >::Reference | Reference to the value of the map |
CArgParser::RefType | Magic type for operator[] |
CResidualDigraph< DGR, CM, FM, TL >::ResidualCapacity | Residual capacity map |
CResidualDigraph< DGR, CM, FM, TL > | Adaptor class for composing the residual digraph for directed flow and circulation problems |
CPathDumper< GR >::RevArcIt | LEMON style iterator for enumerating the arcs of a path in reverse direction |
CReverseDigraph< DGR > | Adaptor class for reversing the orientation of the arcs in a digraph |
►CLpBase::Row | Refer to a row of the LP |
CLpBase::RowIt | Iterator for iterate over the rows of an LP problem |
CGridGraph::RowMap | Map to get the row of the nodes |
CSectionReader | Section reader class |
CSectionWriter | Section writer class |
CSimpleBucketHeap< IM, MIN > | Simplified bucket heap data structure |
CSimplePath< GR > | A structure for representing directed paths in a digraph |
CSmartArcSet< GR > | Digraph using a node set of another digraph or graph and an own arc set |
CSmartBpGraph | A smart undirected bipartite graph class |
CSmartDigraph | A smart directed graph class |
CSmartEdgeSet< GR > | Graph using a node set of another digraph or graph and an own edge set |
CSmartGraph | A smart undirected graph class |
CSmartDigraph::Snapshot | Class to make a snapshot of the digraph and to restore it later |
CListGraph::Snapshot | Class to make a snapshot of the graph and restore it later |
CListDigraph::Snapshot | Class to make a snapshot of the digraph and restore it later |
CListBpGraph::Snapshot | Class to make a snapshot of the graph and restore it later |
CSmartBpGraph::Snapshot | Class to make a snapshot of the graph and to restore it later |
CSmartGraph::Snapshot | Class to make a snapshot of the graph and to restore it later |
CSourceMap< GR > | Map of the source nodes of arcs in a digraph |
CSplitNodes< DGR > | Adaptor class for splitting the nodes of a digraph |
CStaticDigraph | A static directed graph class |
CStaticPath< GR > | A structure for representing directed paths in a digraph |
CSubDigraph< DGR, NF, AF > | Adaptor class for hiding nodes and arcs in a digraph |
CSubGraph< GR, NF, EF > | Adaptor class for hiding nodes and edges in an undirected graph |
CSuurballe< GR, LEN, TR > | Algorithm for finding arc-disjoint paths between two nodes having minimum total length |
►CSuurballe< GR, LEN, SetFlowMapTraits< T > > | |
CSuurballe< GR, LEN, TR >::SetFlowMap< T > | Named parameter for setting FlowMap type |
►CSuurballe< GR, LEN, SetHeapTraits< H, typename Digraph::template NodeMap< int > > > | |
CSuurballe< GR, LEN, TR >::SetHeap< H, CR > | Named parameter for setting Heap and HeapCrossRef types |
►CSuurballe< GR, LEN, SetPathTraits< T > > | |
CSuurballe< GR, LEN, TR >::SetPath< T > | Named parameter for setting Path type |
►CSuurballe< GR, LEN, SetPotentialMapTraits< T > > | |
CSuurballe< GR, LEN, TR >::SetPotentialMap< T > | Named parameter for setting PotentialMap type |
CSuurballeDefaultTraits< GR, LEN > | Default traits class of Suurballe algorithm |
CTargetMap< GR > | Map of the target nodes of arcs in a digraph |
►CTimer | Class for measuring the cpu time and real time usage of the process |
CTimeReport | Same as Timer but prints a report on destruction |
CTimeStamp | A class to store (cpu)time instances |
CTolerance< T > | A class to provide a basic way to handle the comparison of numbers that are obtained as a result of a probably inexact computation |
CTolerance< double > | Double specialization of Tolerance |
CTolerance< float > | Float specialization of Tolerance |
CTolerance< long double > | Long double specialization of Tolerance |
CIterableBoolMap< GR, K >::TrueIt | Iterator for the keys mapped to true |
CUndirector< DGR > | Adaptor class for viewing a digraph as an undirected graph |
CUndirector< const Digraph > | |
CUnionFind< IM > | A Union-Find data structure implementation |
CUnionFindEnum< IM > | A Union-Find data structure implementation which is able to enumerate the components |
CIterableValueMap< GR, K, V >::ValueIt | Forward iterator for values |
CCrossRefMap< GR, K, V >::ValueIt | Forward iterator for values |
►CWriteMap< K, T > | Writable map concept |
CReadWriteMap< K, T > | Read/writable map concept |
►CWriteMap< Arc, T > | |
CReadWriteMap< Arc, T > | |
►CWriteMap< Arc, V > | |
CReadWriteMap< Arc, V > | |
►CWriteMap< Edge, T > | |
CReadWriteMap< Edge, T > | |
►CWriteMap< Edge, V > | |
CReadWriteMap< Edge, V > | |
►CWriteMap< K, V > | |
CReadWriteMap< K, V > | |
►CWriteMap< Node, T > | |
CReadWriteMap< Node, T > | |
►CWriteMap< Node, V > | |
CReadWriteMap< Node, V > | |
CXMap< M > | Map of x-coordinates of a Point -map |
CYMap< M > | Map of y-coordinates of a Point -map |