Class Hierarchy
This inheritance list is sorted roughly, but not completely, alphabetically:
[detail level 12345]
 CBellmanFord< GR, LEN, TR >::ActiveItLEMON iterator for getting the active nodes
 CAlterableDigraphComponent< BAS >Skeleton class for alterable directed graphs
 CDigraph::ArcThe arc type of the digraph
 CBpGraph::ArcThe arc type of the graph
 CGraph::ArcThe arc type of the graph
 CPath< GR >::ArcItLEMON style iterator for enumerating the arcs of a path
 CPathDumper< GR >::ArcItLEMON style iterator for enumerating the arcs of a path
 CSimplePath< GR >::ArcItIterator class to iterate on the arcs of the paths
 CPath< GR >::ArcItLEMON style iterator for path arcs
 CListPath< GR >::ArcItIterator class to iterate on the arcs of the paths
 CStaticPath< GR >::ArcItIterator class to iterate on the arcs of the paths
 CArcLookUp< GR >Fast arc look-up between given endpoints
 CArgParserCommand line arguments parser
 CBackwardMap< GR >Map of the "backward" directed arc view of edges in a graph
 CBaseDigraphComponentBase 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
 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 >
 CBfsWizard< TR >Auxiliary class for the function-type interface of BFS algorithm
 CBfsWizardDefaultTraits< GR >Default traits class of bfs() function
 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 >::BlossomItIterator for obtaining the nodes of a blossom
 CMaxWeightedPerfectMatching< GR, WM >::BlossomItIterator for obtaining the nodes of a blossom
 CBox< T >Bounding box of plain vectors (points)
 CBpGraphClass 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 >::ClassItLEMON style iterator for the classes
 CUnionFindEnum< IM >::ClassItLEMON style iterator for the representant items
 CHeapUnionFind< V, IM, Comp >::ClassItClass iterator
 CClearableDigraphComponent< BAS >Skeleton class for clearable directed graphs
 CGrossoLocatelliPullanMc< GR >::CliqueNodeItIterator to list the nodes of the found clique
 CLpBase::Expr::CoeffItIterator over the expression
 CLpBase::DualExpr::CoeffItIterator over the expression
 CLpBase::ColRefer to a column of the LP
 CGridGraph::ColMapMap to get the column of the nodes
 CColorData structure representing RGB colors
 CUndirector< DGR >::CombinedArcMap< FW, BK >Arc map combined from two original arc maps
 CSplitNodes< DGR >::CombinedArcMap< AM, NM >Arc map combined from an arc map and a node map of the original digraph
 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::ConstCoeffItConst iterator over the expression
 CLpBase::DualExpr::ConstCoeffItIterator over the expression
 CLpBase::ConstrLinear 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
 CCounterA counter class
 CCplexEnvReference 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
 CDigraphClass 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, CR > >
 CDijkstra< Digraph, LengthMap, SetOperationTraitsTraits< T > >
 CDijkstra< Digraph, LengthMap, SetPredMapTraits< T > >
 CDijkstra< Digraph, LengthMap, SetProcessedMapTraits< T > >
 CDijkstra< Digraph, LengthMap, SetStandardHeapTraits< H, CR > >
 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
 CDimacsDescriptorDIMACS file type descriptor
 CLpBase::DualExprLinear expression of rows
 CMinCostArborescence< GR, CM, TR >::DualItLEMON iterator for getting a dual variable
 CDynArcLookUp< GR >Dynamic arc look-up between given endpoints
 CBpGraph::EdgeThe edge type of the graph
 CGraph::EdgeThe 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
 CErasableDigraphComponent< BAS >Skeleton class for erasable directed graphs
 CErasableGraphComponent< BAS >Skeleton class for erasable undirected graphs
 CEulerIt< GR >Euler tour iterator for graphs
 CexceptionSTL class
 CLpBase::ExprLinear expression of variables and a constant component
 CExtendableBpGraphComponent< BAS >Skeleton class for extendable undirected bipartite graphs
 CExtendableDigraphComponent< BAS >Skeleton class for extendable directed graphs
 CExtendableGraphComponent< BAS >Skeleton class for extendable undirected graphs
 CExtendFindEnum< IM >A Extend-Find data structure implementation which is able to enumerate the components
 CIterableBoolMap< GR, K >::FalseItIterator 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
 CFullBpGraphAn undirected full bipartite graph class
 CFullDigraphA directed full graph class
 CFullGraphAn undirected full graph class
 CGomoryHu< GR, CAP >Gomory-Hu cut tree algorithm
 CGraphClass 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
 CGraphItemConcept class for Node, Arc and Edge types
 CGraphItem< 'e'>
 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
 CGridGraphGrid 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
 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
 CHypercubeGraphHypercube graph class
 CHypercubeGraph::HyperMap< T, BF >Linear combination map
 CIDableDigraphComponent< BAS >Skeleton class for idable directed graphs
 CInDegMap< GR >Map of the in-degrees of nodes in a digraph
 CGridGraph::IndexMapMap to get the indices of the nodes as dim2::Point<int>
 CInsertionTsp< CM >Insertion algorithm for symmetric TSP
 CInvalidDummy type to make it easier to create invalid iterators
 CIdMap< GR, K >::InverseMapThe inverse map type of IdMap
 CCrossRefMap< GR, K, V >::InverseMapThe inverse map type of CrossRefMap
 CRangeIdMap< GR, K >::InverseMapThe inverse map type of RangeIdMap
 CIterableBoolMap< GR, K >::ItemItIterator for the keys mapped to a given value
 CIterableIntMap< GR, K >::ItemItIterator for the keys with the same value
 CIterableValueMap< GR, K, V >::ItemItIterator for the keys with the same value
 CUnionFindEnum< IM >::ItemItLEMON style iterator for the items of a component
 CExtendFindEnum< IM >::ItemItLEMON style iterator for the items of a component
 CHeapUnionFind< V, IM, Comp >::ItemItLEMON style iterator for the items of a class
 CIterableBoolMap< GR, K >Dynamic iterable bool map
 CIterableDigraphComponent< BAS >Skeleton class for iterable directed graphs
 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
 CLgfContentsReader 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
 CListBpGraphA general undirected graph structure
 CListDigraphA general directed graph structure
 CListEdgeSet< GR >Graph using a node set of another digraph or graph and an own edge set
 CListGraphA general undirected graph structure
 CListPath< GR >A structure for representing directed paths in a digraph
 CLpBaseCommon 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< M1::Key, V >
 CMapBase< M2::Key, M1::Value >
 CMapBase< M::Key, bool >
 CMapBase< M::Key, M::Value >
 CMapBase< M::Key, V >
 CMapBase< T, T >
 CMapBase< typename DGR::Node, Const< bool, true > >
 CMapBase< typename Digraph::Arc, Const< bool, true > >
 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, dim2::Point< double > >
 CMapBase< typename Graph::Node, double >
 CMapBase< typename Graph::Node, int >
 CMapBase< typename Graph::Node, lemon::Color >
 CMappableDigraphComponent< BAS >Skeleton class for mappable directed graphs
 CMaxCardinalitySearch< GR, CAP, TR >Maximum Cardinality Search algorithm class
 CMaxCardinalitySearch< Digraph, CapacityMap, DefCapacityMapTraits< T > >
 CMaxCardinalitySearch< Digraph, CapacityMap, DefCardinalityMapTraits< T > >
 CMaxCardinalitySearch< Digraph, CapacityMap, DefHeapTraits< H, CR > >
 CMaxCardinalitySearch< Digraph, CapacityMap, DefProcessedMapTraits< T > >
 CMaxCardinalitySearch< Digraph, CapacityMap, DefStandardHeapTraits< H, CR > >
 CMaxCardinalitySearchDefaultTraits< GR, CAP >Default traits class of MaxCardinalitySearch class
 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, SetPredMapTraits< T > >
 CMinCostArborescenceDefaultTraits< GR, CM >Default traits class for MinCostArborescence class
 CGomoryHu< GR, CAP >::MinCutEdgeItIterate on the edges of a minimum cut
 CGomoryHu< GR, CAP >::MinCutNodeItIterate on the nodes of a minimum cut
 CNagamochiIbaraki< GR, CM, TR >Calculates the minimum cut in an undirected graph
 CNagamochiIbaraki< Graph, CapacityMap, SetHeapTraits< H, CR > >
 CNagamochiIbaraki< Graph, CapacityMap, SetStandardHeapTraits< H, CR > >
 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::NodeThe node type of the graph
 CDigraph::NodeThe node type of the digraph
 CGraph::NodeThe 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 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< 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
 CRandomMersenne 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, V >
 CReadMap< Edge, T >
 CReadMap< Edge, V >
 CReadMap< K, V >
 CReadMap< Node, T >
 CReadMap< Node, V >
 CIterableIntMap< GR, K >::ReferenceReference to the value of the map
 CIterableBoolMap< GR, K >::ReferenceReference to the value of the map
 CArgParser::RefTypeMagic type for operator[]
 CResidualDigraph< DGR, CM, FM, TL >::ResidualCapacityResidual capacity map
 CResidualDigraph< DGR, CM, FM, TL >Adaptor class for composing the residual digraph for directed flow and circulation problems
 CPathDumper< GR >::RevArcItLEMON 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::RowRefer to a row of the LP
 CGridGraph::RowMapMap to get the row of the nodes
 CSectionReaderSection reader class
 CSectionWriterSection 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
 CSmartBpGraphA smart undirected bipartite graph class
 CSmartDigraphA smart directed graph class
 CSmartEdgeSet< GR >Graph using a node set of another digraph or graph and an own edge set
 CSmartGraphA smart undirected graph class
 CListDigraph::SnapshotClass to make a snapshot of the digraph and restore it later
 CSmartDigraph::SnapshotClass to make a snapshot of the digraph and to restore it later
 CSmartGraph::SnapshotClass to make a snapshot of the graph and to restore it later
 CSmartBpGraph::SnapshotClass to make a snapshot of the graph and to restore it later
 CListBpGraph::SnapshotClass to make a snapshot of the graph and restore it later
 CListGraph::SnapshotClass to make a snapshot of the graph and 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
 CStaticDigraphA 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, SetHeapTraits< H, CR > >
 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
 CTimerClass for measuring the cpu time and real time usage of the process
 CTimeStampA 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 >::TrueItIterator 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
 CCrossRefMap< GR, K, V >::ValueItForward iterator for values
 CIterableValueMap< GR, K, V >::ValueItForward iterator for values
 CWriteMap< K, T >Writable map concept
 CWriteMap< Arc, T >
 CWriteMap< Arc, V >
 CWriteMap< Edge, T >
 CWriteMap< Edge, V >
 CWriteMap< K, V >
 CWriteMap< Node, T >
 CWriteMap< Node, V >
 CXMap< M >Map of x-coordinates of a Point-map
 CYMap< M >Map of y-coordinates of a Point-map