![]() |
abLEMON 1.9.0-101-gccb8629
A maintained fork of LEMON
|
| CBellmanFord< GR , LEN , TR >::ActiveIt | LEMON iterator for getting the active nodes |
| CAlterableDigraphComponent< Base > | |
| CBpGraph::Arc | The arc type of the graph |
| CDigraph::Arc | The arc type of the digraph |
| CGraph::Arc | The arc type of the graph |
| 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 |
| CListPath< GR >::ArcIt | Iterator class to iterate on the arcs of the paths |
| CPath< GR >::ArcIt | LEMON style iterator for path arcs |
| CSimplePath< 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 |
| CArgParser | Command line arguments parser |
| CAStar< GR , LEN , HM , TR > | A* algorithm for a shortest path between two nodes |
| CAStarDefaultTraits< GR , LEN > | The default traits class of AStar |
| CBackwardMap< GR > | Map of the "backward" directed arc view of edges in a graph |
| CBaseDigraphComponent | Base skeleton class for directed graphs |
| CBellmanFord< GR , LEN , TR > | BellmanFord algorithm class |
| CBellmanFord< Digraph , LengthMap , SetDistMapTraits< T > > | |
| CBellmanFord< Digraph , LengthMap , SetOperationTraitsTraits< T > > | |
| CBellmanFord< Digraph , LengthMap , SetPredMapTraits< T > > | |
| CBellmanFordDefaultOperationTraits< V , has_inf > | Default OperationTraits for the BellmanFord algorithm class |
| CBellmanFordDefaultOperationTraits< C > | |
| 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 |
| CBfs< GR , TR > | BFS algorithm class |
| CBfs< Digraph , SetDistMapTraits< T > > | |
| CBfs< Digraph , SetPredMapTraits< T > > | |
| CBfs< Digraph , SetProcessedMapTraits< T > > | |
| CBfs< Digraph , SetReachedMapTraits< T > > | |
| CBfs< Digraph , SetStandardProcessedMapTraits > | |
| CBfsDefaultTraits< GR > | Default traits class of Bfs class |
| CBfsVisit< GR , VS , TR > | BFS algorithm class with visitor interface |
| CBfsVisit< Digraph , Visitor , SetReachedMapTraits< T > > | |
| CBfsVisitDefaultTraits< GR > | Default traits class of BfsVisit class |
| CBfsVisitor< GR > | Visitor class for BFS |
| CBfsVisitor< Digraph > | |
| CBfsVisitor< G > | |
| CBfsWizard< TR > | Auxiliary class for the function-type interface of BFS algorithm |
| CBfsWizardDefaultTraits< GR > | Default traits class of bfs() function |
| CBidirDijkstra< GR , LEN , TR > | Bidirectional Dijkstra algorithm for a shortest path between two nodes |
| CBidirDijkstraDefaultTraits< GR , LEN > | The default traits class of BidirDijkstra |
| CBinHeap< PR , IM , CMP > | Binary heap data structure |
| 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 > > | |
| 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< Digraph , LowerMap , UpperMap , SupplyMap , SetFlowMapTraits< T > > | |
| CCirculation< Digraph , LowerMap , UpperMap , SupplyMap , SetStandardElevatorTraits< T > > | |
| CCirculationDefaultTraits< GR , LM , UM , SM > | Default traits class of Circulation class |
| CExtendFindEnum< IM >::ClassIt | LEMON style iterator for the classes |
| CHeapUnionFind< V , IM , Comp >::ClassIt | Class iterator |
| CUnionFindEnum< IM >::ClassIt | LEMON style iterator for the representant items |
| CGrossoLocatelliPullanMc< GR >::CliqueNodeIt | Iterator to list the nodes of the found clique |
| CLpBase::DualExpr::CoeffIt | Iterator over the expression |
| CLpBase::Expr::CoeffIt | Iterator over the expression |
| CLpBase::Col | Refer to a column of the LP |
| 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 |
| CCompactDigraph | A static directed graph class |
| 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::DualExpr::ConstCoeffIt | Iterator over the expression |
| CLpBase::Expr::ConstCoeffIt | Const 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 > > | |
| 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< Digraph , SetPredMapTraits< T > > | |
| CDfs< Digraph , SetProcessedMapTraits< T > > | |
| CDfs< Digraph , SetReachedMapTraits< T > > | |
| CDfs< Digraph , SetStandardProcessedMapTraits > | |
| CDfsDefaultTraits< GR > | Default traits class of Dfs class |
| CDfsVisit< GR , VS , TR > | DFS algorithm class with visitor interface |
| CDfsVisit< Digraph , Visitor , SetReachedMapTraits< T > > | |
| 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 |
| 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< Digraph , LengthMap , SetHeapTraits< H , typename Digraph::template NodeMap< int > > > | |
| CDijkstra< Digraph , LengthMap , SetOperationTraitsTraits< T > > | |
| CDijkstra< Digraph , LengthMap , SetPredMapTraits< T > > | |
| CDijkstra< Digraph , LengthMap , SetProcessedMapTraits< T > > | |
| CDijkstra< Digraph , LengthMap , SetStandardHeapTraits< H , typename Digraph::template NodeMap< int > > > | |
| CDijkstra< Digraph , LengthMap , SetStandardProcessedMapTraits > | |
| 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 |
| 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 |
| CGraph::Edge | The edge type of the graph |
| CEdmondsKarp< GR , CAP , TR > | Edmonds-Karp algorithms class |
| CEdmondsKarp< Digraph , CapacityMap , SetFlowMapTraits< T > > | |
| 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 |
| 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 |
| CGraphIncIt< Digraph , Arc , Node , 'i' > | |
| CGraphIncIt< Digraph , Arc , Node , 'o' > | |
| CGraphIncIt< Graph , Edge , Node , 'e' > | |
| CGraphItem | Concept class for Node, Arc and Edge types |
| CGraphItem< 'e' > | |
| CGraphItem< 'n' > | |
| CGraphItemIt< GR , Item > | Concept class for NodeIt, ArcIt and EdgeIt types |
| CGraphItemIt< BpGraph , BlueNode > | |
| CGraphItemIt< BpGraph , RedNode > | |
| CGraphItemIt< Digraph , Arc > | |
| CGraphItemIt< Digraph , Node > | |
| CGraphItemIt< Graph , Edge > | |
| 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 , SetPathTraits< T > > | |
| 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 |
| CHopcroftKarp< BPGR > | Maximum cardinality matching in bipartite graphs |
| CHowardMmc< GR , CM , TR > | Implementation of Howard's algorithm for finding a minimum mean cycle |
| CHowardMmc< GR , CM , SetLargeCostTraits< T > > | |
| CHowardMmc< GR , CM , SetPathTraits< T > > | |
| 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 |
| CCrossRefMap< GR , K , V >::InverseMap | The inverse map type of CrossRefMap |
| CIdMap< GR , K >::InverseMap | The inverse map type of IdMap |
| CRangeIdMap< GR , K >::InverseMap | The inverse map type of RangeIdMap |
| 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 >::ItemIt | Iterator for the keys mapped to a given value |
| 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 |
| CUnionFindEnum< IM >::ItemIt | LEMON style iterator for the items of a component |
| 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 , SetPathTraits< T > > | |
| CKarpMmcDefaultTraits< GR , CM > | Default traits class of KarpMmc class |
| CKBestExtremeFlows< GR , V , C > | The K best extreme flows of a minimum cost flow problem |
| CKBestFlows< GR , V , C > | The K best integer flows of a minimum cost flow problem |
| CLemonItWrapper< T > | Template to make STL iterators from Lemon iterators |
| CLemonItWrapper< LIT > | |
| CLemonRangeWrapper1< LIT , P > | A generic wrapper for Lemon iterators for range-based for loops |
| CLemonRangeWrapper2< LIT , P1 , P2 > | A generic wrapper for Lemon iterators for range-based for loops |
| 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 |
| CMapBase< K , V > | Base class of maps |
| CMapBase< GR::Edge , Const< bool , true > > | |
| CMapBase< int , BlossomData > | |
| CMapBase< int , Color > | |
| CMapBase< int , NodeData > | |
| CMapBase< int , V > | |
| CMapBase< K , bool > | |
| CMapBase< K , int > | |
| CMapBase< KEY , bool > | |
| CMapBase< M1::Key , bool > | |
| CMapBase< M1::Key , M1::Value > | |
| CMapBase< M2::Key , M1::Value > | |
| CMapBase< M::Key , bool > | |
| CMapBase< M::Key , M::Value > | |
| CMapBase< M::Key , V > | |
| CMapBase< T , T > | |
| CMapBase< typename Digraph::Arc , Const< bool , true > > | |
| CMapBase< typename F::argument_type , typename F::result_type > | |
| CMapBase< typename GR::Edge , Const< bool , true > > | |
| CMapBase< typename GR::Node , Const< bool , true > > | |
| CMapBase< typename Graph::Arc , double > | |
| CMapBase< typename Graph::Arc , lemon::Color > | |
| CMapBase< typename Graph::Node , bool > | |
| CMapBase< typename Graph::Node , double > | |
| CMapBase< typename Graph::Node , int > | |
| CMapBase< typename Graph::Node , lemon::Color > | |
| CMaxCardinalitySearch< GR , CAP , TR > | Maximum Cardinality Search algorithm class |
| CMaxCardinalitySearch< Digraph , CapacityMap , DefCapacityMapTraits< T > > | |
| CMaxCardinalitySearch< Digraph , CapacityMap , DefCardinalityMapTraits< T > > | |
| CMaxCardinalitySearch< Digraph , CapacityMap , DefHeapTraits< H , typename Digraph::template NodeMap< int > > > | |
| CMaxCardinalitySearch< Digraph , CapacityMap , DefProcessedMapTraits< T > > | |
| CMaxCardinalitySearch< Digraph , CapacityMap , DefStandardHeapTraits< H , typename Digraph::template NodeMap< int > > > | |
| CMaxCardinalitySearchDefaultTraits< GR , CAP > | Default traits class of MaxCardinalitySearch class |
| CMaxFlow< GR , CAP > | Checks the general interface of a max flow algorithm |
| CMaxFractionalMatching< GR , TR > | Max cardinality fractional matching |
| CMaxFractionalMatching< Graph , SetElevatorTraits< T > > | |
| CMaxFractionalMatching< Graph , SetMatchingMapTraits< T > > | |
| CMaxFractionalMatching< Graph , SetStandardElevatorTraits< T > > | |
| 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< Digraph , CostMap , SetHeapTraits< H , typename Digraph::template NodeMap< int > > > | |
| CMinCostArborescence< Digraph , CostMap , SetPredMapTraits< T > > | |
| CMinCostArborescenceDefaultTraits< GR , CM > | Default traits class for MinCostArborescence class |
| CMinCostAssignment< BPGR , CM > | Minimum cost assignment in bipartite graphs |
| CMinCostFlow< GR , Value , Cost > | Check the interface of an MCF algorithm |
| CGomoryHu< GR , CAP >::MinCutEdgeIt | Iterate on the edges of a minimum cut |
| CGomoryHu< GR , CAP >::MinCutNodeIt | Iterate on the nodes of a minimum cut |
| CMinMeanCycle< GR , Cost > | Check the interface of an MMC algorithm |
| CNagamochiIbaraki< GR , CM , TR > | Calculates the minimum cut in an undirected graph |
| CNagamochiIbaraki< Graph , CapacityMap , SetHeapTraits< H , typename Graph::template NodeMap< int > > > | |
| CNagamochiIbaraki< Graph , CapacityMap , SetStandardHeapTraits< H , typename Graph::template NodeMap< int > > > | |
| CNagamochiIbaraki< Graph , CapacityMap , SetUnitCapacityTraits > | |
| 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 |
| CDigraph::Node | The node type of the digraph |
| CGraph::Node | The node type of the graph |
| 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 for iterating 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) |
| CPotentialDifferenceMap< GR , POT > | Potential difference map |
| CPreflow< GR , CAP , TR > | Preflow algorithm class |
| CPreflow< Digraph , CapacityMap , SetElevatorTraits< T > > | |
| CPreflow< Digraph , CapacityMap , SetFlowMapTraits< T > > | |
| CPreflow< Digraph , CapacityMap , SetStandardElevatorTraits< T > > | |
| 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< Word > | 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 |
| CReadMap< Arc , T > | |
| CReadMap< Arc , Value > | |
| CReadMap< Edge , T > | |
| CReadMap< Node , T > | |
| 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 |
| CGridGraph::RowMap | Map to get the row of the nodes |
| CSectionReader | Section reader class |
| CSectionWriter | Section writer class |
| CAStar< GR , LEN , HM , TR >::SetHeap< H , CR > | Named parameter for setting the type of the heap |
| CBidirDijkstra< GR , LEN , TR >::SetHeap< H , CR > | Named parameter for setting the type of the heaps |
| 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 |
| CListBpGraph::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 |
| CListGraph::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 |
| CSmartDigraph::Snapshot | Class to make a snapshot of the digraph 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 |
| CStaticGraph | A static undirected 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 , SetHeapTraits< H , typename Digraph::template NodeMap< int > > > | |
| CSuurballe< GR , LEN , SetPathTraits< T > > | |
| CSuurballe< GR , LEN , SetPotentialMapTraits< T > > | |
| 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 |
| 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 |
| CTomitaSekiMc< GR > | The exact maximum clique algorithm of Tomita and Seki |
| CIterableBoolMap< GR , K >::TrueIt | Iterator for the keys mapped to true |
| CUndirector< DGR > | Adaptor class for viewing a digraph as an undirected graph |
| CUnionFind< IM > | A Union-Find data structure implementation |
| CUnionFindEnum< IM > | A Union-Find data structure implementation which is able to enumerate the components |
| CCrossRefMap< GR , K , V >::ValueIt | Forward iterator for values |
| CIterableValueMap< GR , K , V >::ValueIt | Forward iterator for values |
| CVf2< G1 , G2 , M , NEQ > | VF2 algorithm class |
| CVf2pp< G1 , G2 , M , M1 , M2 > | VF2 Plus Plus algorithm class [24] |
| CVf2ppWizard< TR > | Auxiliary class for the function-type interface of VF2 Plus Plus algorithm |
| CVf2Wizard< TR > | |
| CWriteMap< K , T > | Writable map concept |
| CWriteMap< Arc , T > | |
| CWriteMap< Arc , Value > | |
| CWriteMap< Edge , T > | |
| CWriteMap< Node , T > | |
| CXMap< M > | Map of x-coordinates of a Point-map |
| CYMap< M > | Map of y-coordinates of a Point-map |