|
My Project
|
| ►Nlemon | The namespace of LEMON |
| ►Nconcepts | The namespace of LEMON concepts and concept checking classes |
| CAlterableBpGraphComponent | Skeleton class for alterable undirected bipartite graphs |
| CAlterableDigraphComponent | Skeleton class for alterable directed graphs |
| CAlterableGraphComponent | Skeleton class for alterable undirected graphs |
| ►CBaseBpGraphComponent | Base skeleton class for undirected bipartite graphs |
| CBlueNode | Class to represent blue nodes |
| CRedNode | Class to represent red nodes |
| CBaseDigraphComponent | Base skeleton class for directed graphs |
| ►CBaseGraphComponent | Base skeleton class for undirected graphs |
| CEdge | Undirected edge class of the graph |
| ►CBpGraph | Class describing the concept of undirected bipartite graphs |
| CArc | The arc type of the graph |
| CArcIt | Iterator class for the arcs |
| CArcMap | Standard graph map type for the arcs |
| CBlueNode | Class to represent blue nodes |
| CBlueNodeIt | Iterator class for the blue nodes |
| CBlueNodeMap | Standard graph map type for the blue nodes |
| CEdge | The edge type of the graph |
| CEdgeIt | Iterator class for the edges |
| CEdgeMap | Standard graph map type for the edges |
| CInArcIt | Iterator class for the incoming arcs of a node |
| CIncEdgeIt | Iterator class for the incident edges of a node |
| CNode | The node type of the graph |
| CNodeIt | Iterator class for the nodes |
| CNodeMap | Standard graph map type for the nodes |
| COutArcIt | Iterator class for the outgoing arcs of a node |
| CRedNode | Class to represent red nodes |
| CRedNodeIt | Iterator class for the red nodes |
| CRedNodeMap | Standard graph map type for the red nodes |
| CClearableBpGraphComponent | Skeleton class for clearable undirected biparite graphs |
| CClearableDigraphComponent | Skeleton class for clearable directed graphs |
| CClearableGraphComponent | Skeleton class for clearable undirected graphs |
| ►CDigraph | Class describing the concept of directed graphs |
| CArc | The arc type of the digraph |
| CArcIt | Iterator class for the arcs |
| CArcMap | Standard graph map type for the arcs |
| CInArcIt | Iterator class for the incoming arcs of a node |
| CNode | The node type of the digraph |
| CNodeIt | Iterator class for the nodes |
| CNodeMap | Standard graph map type for the nodes |
| COutArcIt | Iterator class for the outgoing arcs of a node |
| CErasableBpGraphComponent | Skeleton class for erasable undirected graphs |
| CErasableDigraphComponent | Skeleton class for erasable directed graphs |
| CErasableGraphComponent | Skeleton class for erasable undirected graphs |
| CExtendableBpGraphComponent | Skeleton class for extendable undirected bipartite graphs |
| CExtendableDigraphComponent | Skeleton class for extendable directed graphs |
| CExtendableGraphComponent | Skeleton class for extendable undirected graphs |
| ►CGraph | Class describing the concept of undirected graphs |
| CArc | The arc type of the graph |
| CArcIt | Iterator class for the arcs |
| CArcMap | Standard graph map type for the arcs |
| CEdge | The edge type of the graph |
| CEdgeIt | Iterator class for the edges |
| CEdgeMap | Standard graph map type for the edges |
| CInArcIt | Iterator class for the incoming arcs of a node |
| CIncEdgeIt | Iterator class for the incident edges of a node |
| CNode | The node type of the graph |
| CNodeIt | Iterator class for the nodes |
| CNodeMap | Standard graph map type for the nodes |
| COutArcIt | Iterator class for the outgoing arcs of a node |
| CGraphIncIt | Concept class for InArcIt, OutArcIt and IncEdgeIt types |
| CGraphItem | Concept class for Node, Arc and Edge types |
| CGraphItemIt | Concept class for NodeIt, ArcIt and EdgeIt types |
| CGraphMap | Concept class for standard graph maps |
| CHeap | The heap concept |
| CIDableBpGraphComponent | Skeleton class for idable undirected bipartite graphs |
| CIDableDigraphComponent | Skeleton class for idable directed graphs |
| CIDableGraphComponent | Skeleton class for idable undirected graphs |
| CIterableBpGraphComponent | Skeleton class for iterable undirected bipartite graphs |
| CIterableDigraphComponent | Skeleton class for iterable directed graphs |
| CIterableGraphComponent | Skeleton class for iterable undirected graphs |
| ►CMappableBpGraphComponent | Skeleton class for mappable undirected bipartite graphs |
| CBlueNodeMap | Standard graph map for the blue nodes |
| CRedNodeMap | Standard graph map for the red nodes |
| ►CMappableDigraphComponent | Skeleton class for mappable directed graphs |
| CArcMap | Standard graph map for the arcs |
| CNodeMap | Standard graph map for the nodes |
| ►CMappableGraphComponent | Skeleton class for mappable undirected graphs |
| CEdgeMap | Standard graph map for the edges |
| ►CPath | A skeleton structure for representing directed paths in a digraph |
| CArcIt | LEMON style iterator for enumerating the arcs of a path |
| ►CPathDumper | A skeleton structure for path dumpers |
| CArcIt | LEMON style iterator for enumerating the arcs of a path |
| CRevArcIt | LEMON style iterator for enumerating the arcs of a path in reverse direction |
| CReadMap | Readable map concept |
| CReadWriteMap | Read/writable map concept |
| CReferenceMap | Dereferable map concept |
| CWriteMap | Writable map concept |
| ►Ndim2 | Tools for handling two dimensional coordinates |
| CBox | Bounding box of plain vectors (points) |
| CConstXMap | Constant (read only) version of XMap |
| CConstYMap | Constant (read only) version of YMap |
| CNormSquareMap | Map of the normSquare() of a Point-map |
| CPoint | Two dimensional vector (plain vector) |
| CXMap | Map of x-coordinates of a Point-map |
| CYMap | Map of y-coordinates of a Point-map |
| CAbsMap | Absolute value of a map |
| CAddMap | Sum of two maps |
| CAllArcLookUp | Fast look-up of all arcs between given endpoints |
| CAndMap | Logical 'and' of two maps |
| CArcLookUp | Fast arc look-up between given endpoints |
| ►CArgParser | Command line arguments parser |
| CRefType | Magic type for operator[] |
| CArgParserException | Exception used by ArgParser |
| CBackwardMap | Map of the "backward" directed arc view of edges in a graph |
| ►CBellmanFord | BellmanFord algorithm class |
| CActiveIt | LEMON iterator for getting the active nodes |
| CSetDistMap | Named parameter for setting DistMap type |
| CSetOperationTraits | Named parameter for setting OperationTraits type |
| CSetPredMap | Named parameter for setting PredMap type |
| CBellmanFordDefaultOperationTraits | Default OperationTraits for the BellmanFord algorithm class |
| CBellmanFordDefaultTraits | Default traits class of BellmanFord class |
| CBellmanFordWizard | Auxiliary class for the function-type interface of the Bellman-Ford algorithm |
| CBellmanFordWizardBase | Default traits class used by BellmanFordWizard |
| CBellmanFordWizardDefaultTraits | Default traits class of bellmanFord() function |
| ►CBfs | BFS algorithm class |
| CSetDistMap | Named parameter for setting DistMap type |
| CSetPredMap | Named parameter for setting PredMap type |
| CSetProcessedMap | Named parameter for setting ProcessedMap type |
| CSetReachedMap | Named parameter for setting ReachedMap type |
| CSetStandardProcessedMap | Named parameter for setting ProcessedMap type to be Digraph::NodeMap<bool> |
| CBfsDefaultTraits | Default traits class of Bfs class |
| ►CBfsVisit | BFS algorithm class with visitor interface |
| CSetReachedMap | Named parameter for setting ReachedMap type |
| CBfsVisitDefaultTraits | Default traits class of BfsVisit class |
| CBfsVisitor | Visitor class for BFS |
| CBfsWizard | Auxiliary class for the function-type interface of BFS algorithm |
| CBfsWizardBase | Default traits class used by BfsWizard |
| CBfsWizardDefaultTraits | Default traits class of bfs() function |
| CBinHeap | Binary heap data structure |
| CBinomialHeap | Binomial heap data structure |
| CBpGraphCopy | Class to copy a bipartite graph |
| CBpGraphReader | LGF reader for bipartite graphs |
| CBpGraphWriter | LGF writer for undirected bipartite graphs |
| CBucketHeap | Bucket heap data structure |
| ►CCapacityScaling | Implementation of the Capacity Scaling algorithm for finding a minimum cost flow |
| CSetHeap | Named parameter for setting Heap type |
| CCapacityScalingDefaultTraits | Default traits class of CapacityScaling algorithm |
| CCbcMip | Interface for the CBC MIP solver |
| CChristofidesTsp | Christofides algorithm for symmetric TSP |
| ►CCirculation | Push-relabel algorithm for the network circulation problem |
| CSetElevator | Named parameter for setting Elevator type |
| CSetFlowMap | Named parameter for setting FlowMap type |
| CSetStandardElevator | Named parameter for setting Elevator type with automatic allocation |
| CCirculationDefaultTraits | Default traits class of Circulation class |
| CClpLp | Interface for the CLP solver |
| CColor | Data structure representing RGB colors |
| CCombineMap | Combination of two maps using an STL (binary) functor |
| CComposeMap | Composition of two maps |
| CConArcIt | Iterator for iterating on parallel arcs connecting the same nodes |
| CConEdgeIt | Iterator for iterating on parallel edges connecting the same nodes |
| CConstMap | Constant map |
| CConstMap< K, Const< V, v > > | Constant map with inlined constant value |
| CConvertMap | Map adaptor to convert the Value type of a map to another type using the default conversion |
| ►CCostScaling | Implementation of the Cost Scaling algorithm for finding a minimum cost flow |
| CSetLargeCost | Named parameter for setting LargeCost type |
| CCostScalingDefaultTraits | Default traits class of CostScaling algorithm |
| CCounter | A counter class |
| CCplexBase | Base interface for the CPLEX LP and MIP solver |
| ►CCplexEnv | Reference counted wrapper around cpxenv pointer |
| CLicenseError | This exception is thrown when the license check is not sufficient |
| CCplexLp | Interface for the CPLEX LP solver |
| CCplexMip | Interface for the CPLEX MIP solver |
| ►CCrossRefMap | General cross reference graph map type |
| CInverseMap | The inverse map type of CrossRefMap |
| CValueIt | Forward iterator for values |
| CCycleCanceling | Implementation of cycle-canceling algorithms for finding a minimum cost flow |
| CDefaultGraphToEpsTraits | Default traits class of GraphToEps |
| ►CDfs | DFS algorithm class |
| CSetDistMap | Named parameter for setting DistMap type |
| CSetPredMap | Named parameter for setting PredMap type |
| CSetProcessedMap | Named parameter for setting ProcessedMap type |
| CSetReachedMap | Named parameter for setting ReachedMap type |
| CSetStandardProcessedMap | Named parameter for setting ProcessedMap type to be Digraph::NodeMap<bool> |
| CDfsDefaultTraits | Default traits class of Dfs class |
| ►CDfsVisit | DFS algorithm class with visitor interface |
| CSetReachedMap | Named parameter for setting ReachedMap type |
| CDfsVisitDefaultTraits | Default traits class of DfsVisit class |
| CDfsVisitor | Visitor class for DFS |
| CDfsWizard | Auxiliary class for the function-type interface of DFS algorithm |
| CDfsWizardBase | Default traits class used by DfsWizard |
| CDfsWizardDefaultTraits | Default traits class of dfs() function |
| CDHeap | D-ary heap data structure |
| CDiEulerIt | Euler tour iterator for digraphs |
| CDigraphCopy | Class to copy a digraph |
| CDigraphReader | LGF reader for directed graphs |
| CDigraphWriter | LGF writer for directed graphs |
| ►CDijkstra | Dijkstra algorithm class |
| CSetDistMap | Named parameter for setting DistMap type |
| CSetHeap | Named parameter for setting heap and cross reference types |
| CSetOperationTraits | Named parameter for setting OperationTraits type |
| CSetPredMap | Named parameter for setting PredMap type |
| CSetProcessedMap | Named parameter for setting ProcessedMap type |
| CSetStandardHeap | Named parameter for setting heap and cross reference types with automatic allocation |
| CSetStandardProcessedMap | Named parameter for setting ProcessedMap type to be Digraph::NodeMap<bool> |
| CDijkstraDefaultOperationTraits | Default operation traits for the Dijkstra algorithm class |
| CDijkstraDefaultTraits | Default traits class of Dijkstra class |
| CDijkstraWizard | Auxiliary class for the function-type interface of Dijkstra algorithm |
| CDijkstraWizardBase | Default traits class used by DijkstraWizard |
| CDijkstraWizardDefaultTraits | Default traits class of dijkstra() function |
| CDimacsDescriptor | DIMACS file type descriptor |
| CDivMap | Quotient of two maps |
| CDynArcLookUp | Dynamic arc look-up between given endpoints |
| ►CEdmondsKarp | Edmonds-Karp algorithms class |
| CSetFlowMap | Named parameter for setting FlowMap type |
| CEdmondsKarpDefaultTraits | Default traits class of EdmondsKarp class |
| CElevator | Class for handling "labels" in push-relabel type algorithms |
| CEqualMap | Combination of two maps using the == operator |
| CEulerIt | Euler tour iterator for graphs |
| CException | Generic exception class |
| ►CExtendFindEnum | A Extend-Find data structure implementation which is able to enumerate the components |
| CClassIt | LEMON style iterator for the classes |
| CItemIt | LEMON style iterator for the items of a component |
| CFalseMap | Constant false map |
| CFibHeap | Fibonacci heap data structure |
| CFilterArcs | Adaptor class for hiding arcs in a digraph |
| CFilterEdges | Adaptor class for hiding edges in a graph |
| CFilterNodes | Adaptor class for hiding nodes in a digraph or a graph |
| CForkMap | Applies all map setting operations to two maps |
| CFormatError | Format error |
| CForwardMap | 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 |
| CFunctorToMap | Converts an STL style (unary) functor to a map |
| CGlpkBase | Base interface for the GLPK LP and MIP solver |
| CGlpkLp | Interface for the GLPK LP solver |
| CGlpkMip | Interface for the GLPK MIP solver |
| ►CGomoryHu | Gomory-Hu cut tree algorithm |
| CMinCutEdgeIt | Iterate on the edges of a minimum cut |
| CMinCutNodeIt | Iterate on the nodes of a minimum cut |
| CGraphCopy | Class to copy a graph |
| CGraphReader | LGF reader for undirected graphs |
| CGraphToEps | Auxiliary class to implement the named parameters of graphToEps() |
| CGraphWriter | LGF writer for undirected graphs |
| CGreedyTsp | Greedy algorithm for symmetric TSP |
| ►CGridGraph | Grid graph class |
| CColMap | Map to get the column of the nodes |
| CIndexMap | Map to get the indices of the nodes as dim2::Point<int> |
| CRowMap | Map to get the row of the nodes |
| ►CGrossoLocatelliPullanMc | Implementation of the iterated local search algorithm of Grosso, Locatelli, and Pullan for the maximum clique problem |
| CCliqueNodeIt | Iterator to list the nodes of the found clique |
| CHaoOrlin | Hao-Orlin algorithm for finding a minimum cut in a digraph |
| ►CHartmannOrlinMmc | Implementation of the Hartmann-Orlin algorithm for finding a minimum mean cycle |
| CSetLargeCost | Named parameter for setting LargeCost type |
| CSetPath | Named parameter for setting Path type |
| CHartmannOrlinMmcDefaultTraits | Default traits class of HartmannOrlinMmc class |
| ►CHeapUnionFind | A Union-Find data structure implementation which is able to store a priority for each item and retrieve the minimum of each class |
| CClassIt | Class iterator |
| CItemIt | LEMON style iterator for the items of a class |
| ►CHowardMmc | Implementation of Howard's algorithm for finding a minimum mean cycle |
| CSetLargeCost | Named parameter for setting LargeCost type |
| CSetPath | Named parameter for setting Path type |
| CHowardMmcDefaultTraits | Default traits class of HowardMmc class |
| ►CHypercubeGraph | Hypercube graph class |
| CHyperMap | Linear combination map |
| CIdentityMap | Identity map |
| ►CIdMap | Provides an immutable and unique id for each item in a graph |
| CInverseMap | The inverse map type of IdMap |
| CInDegMap | Map of the in-degrees of nodes in a digraph |
| CInsertionTsp | Insertion algorithm for symmetric TSP |
| CInvalid | Dummy type to make it easier to create invalid iterators |
| CIoError | Input-Output error |
| ►CIterableBoolMap | Dynamic iterable bool map |
| CFalseIt | Iterator for the keys mapped to false |
| CItemIt | Iterator for the keys mapped to a given value |
| CReference | Reference to the value of the map |
| CTrueIt | Iterator for the keys mapped to true |
| ►CIterableIntMap | Dynamic iterable integer map |
| CItemIt | Iterator for the keys with the same value |
| CReference | Reference to the value of the map |
| ►CIterableValueMap | Dynamic iterable map for comparable values |
| CItemIt | Iterator for the keys with the same value |
| CValueIt | Forward iterator for values |
| ►CKarpMmc | Implementation of Karp's algorithm for finding a minimum mean cycle |
| CSetLargeCost | Named parameter for setting LargeCost type |
| CSetPath | Named parameter for setting Path type |
| CKarpMmcDefaultTraits | Default traits class of KarpMmc class |
| CLessMap | Combination of two maps using the < operator |
| CLgfContents | Reader for the contents of the LGF file |
| CLinkedElevator | Class for handling "labels" in push-relabel type algorithms |
| CListArcSet | Digraph using a node set of another digraph or graph and an own arc set |
| ►CListBpGraph | A general undirected graph structure |
| CSnapshot | Class to make a snapshot of the graph and restore it later |
| ►CListDigraph | A general directed graph structure |
| CSnapshot | Class to make a snapshot of the digraph and restore it later |
| CListEdgeSet | Graph using a node set of another digraph or graph and an own edge set |
| ►CListGraph | A general undirected graph structure |
| CSnapshot | Class to make a snapshot of the graph and restore it later |
| ►CListPath | A structure for representing directed paths in a digraph |
| CArcIt | Iterator class to iterate on the arcs of the paths |
| CLoggerBoolMap | Writable bool map for logging each true assigned element |
| ►CLpBase | Common base class for LP and MIP solvers |
| CCol | Refer to a column of the LP |
| CColIt | Iterator for iterate over the columns of an LP problem |
| CConstr | Linear constraint |
| ►CDualExpr | Linear expression of rows |
| CCoeffIt | Iterator over the expression |
| CConstCoeffIt | Iterator over the expression |
| ►CExpr | Linear expression of variables and a constant component |
| CCoeffIt | Iterator over the expression |
| CConstCoeffIt | Const iterator over the expression |
| CRow | Refer to a row of the LP |
| CRowIt | Iterator for iterate over the rows of an LP problem |
| CUnsupportedFormatError | Unsupported file format exception |
| CLpSkeleton | Skeleton class for an LP solver interface |
| CLpSolver | Common base class for LP solvers |
| CMapBase | Base class of maps |
| CMapToFunctor | Converts a map to an STL style (unary) functor |
| ►CMaxCardinalitySearch | Maximum Cardinality Search algorithm class |
| CSetCapacityMap | Named parameter for setting CapacityMap type |
| CSetCardinalityMap | Named parameter for setting CardinalityMap type |
| CSetHeap | Named parameter for setting heap and cross reference type |
| CSetProcessedMap | Named parameter for setting ProcessedMap type |
| CSetStandardHeap | Named parameter for setting heap and cross reference type with automatic allocation |
| CMaxCardinalitySearchDefaultTraits | Default traits class of MaxCardinalitySearch class |
| ►CMaxFractionalMatching | Max cardinality fractional matching |
| CSetElevator | Named parameter for setting Elevator type |
| CSetMatchingMap | Named parameter for setting MatchingMap type |
| CSetStandardElevator | Named parameter for setting Elevator type with automatic allocation |
| CMaxFractionalMatchingDefaultTraits | Default traits class of MaxFractionalMatching class |
| CMaxMatching | Maximum cardinality matching in general graphs |
| CMaxWeightedFractionalMatching | Weighted fractional matching in general graphs |
| ►CMaxWeightedMatching | Weighted matching in general graphs |
| CBlossomIt | Iterator for obtaining the nodes of a blossom |
| CMaxWeightedPerfectFractionalMatching | Weighted fractional perfect matching in general graphs |
| ►CMaxWeightedPerfectMatching | Weighted perfect matching in general graphs |
| CBlossomIt | Iterator for obtaining the nodes of a blossom |
| ►CMinCostArborescence | Minimum Cost Arborescence algorithm class |
| CDualIt | LEMON iterator for getting a dual variable |
| CSetArborescenceMap | Named parameter for setting ArborescenceMap type |
| CSetPredMap | Named parameter for setting PredMap type |
| CMinCostArborescenceDefaultTraits | Default traits class for MinCostArborescence class |
| CMipSkeleton | Skeleton class for a MIP solver interface |
| CMipSolver | Common base class for MIP solvers |
| CMulMap | Product of two maps |
| ►CNagamochiIbaraki | Calculates the minimum cut in an undirected graph |
| CSetHeap | Named parameter for setting heap and cross reference type |
| CSetStandardHeap | Named parameter for setting heap and cross reference type with automatic allocation |
| CSetUnitCapacity | Named parameter for setting the capacity map to a constMap<Edge, int, 1>() instance |
| CNagamochiIbarakiDefaultTraits | Default traits class for NagamochiIbaraki class |
| CNearestNeighborTsp | Nearest neighbor algorithm for symmetric TSP |
| CNegMap | Negative of a map |
| CNegWriteMap | Negative of a map (read-write version) |
| CNetworkSimplex | Implementation of the primal Network Simplex algorithm for finding a minimum cost flow |
| CNoCounter | 'Do nothing' version of Counter |
| CNoTimeReport | 'Do nothing' version of TimeReport |
| CNotMap | Logical 'not' of a map |
| CNotWriteMap | Logical 'not' of a map (read-write version) |
| CNullMap | Null map. (a.k.a. DoNothingMap) |
| COpt2Tsp | 2-opt algorithm for symmetric TSP |
| COrienter | Adaptor class for orienting the edges of a graph to get a digraph |
| COrMap | Logical 'or' of two maps |
| COutDegMap | Map of the out-degrees of nodes in a digraph |
| CPairingHeap | Pairing Heap |
| CPalette | Map ints to different Colors |
| ►CPath | A structure for representing directed paths in a digraph |
| CArcIt | LEMON style iterator for path arcs |
| CPathNodeIt | Class which helps to iterate through the nodes of a path |
| CPlanarColoring | Coloring planar graphs |
| CPlanarDrawing | Schnyder's planar drawing algorithm |
| CPlanarEmbedding | Planar embedding of an undirected simple graph |
| CPotentialDifferenceMap | Potential difference map |
| ►CPreflow | Preflow algorithm class |
| CSetElevator | Named parameter for setting Elevator type |
| CSetFlowMap | Named parameter for setting FlowMap type |
| CSetStandardElevator | Named parameter for setting Elevator type with automatic allocation |
| CPreflowDefaultTraits | Default traits class of Preflow class |
| CQuadHeap | Fourary (quaternary) heap data structure |
| ►CRadixHeap | Radix heap data structure |
| CPriorityUnderflowError | Exception thrown by RadixHeap |
| CRandom | Mersenne Twister random number generator |
| ►CRangeIdMap | Provides continuous and unique id for the items of a graph |
| CInverseMap | The inverse map type of RangeIdMap |
| CRangeMap | Map for storing values for integer keys from the range [0..size-1] |
| ►CResidualDigraph | Adaptor class for composing the residual digraph for directed flow and circulation problems |
| CResidualCapacity | Residual capacity map |
| CReverseDigraph | Adaptor class for reversing the orientation of the arcs in a digraph |
| CScaleMap | Scales a map with a constant |
| CScaleWriteMap | Scales a map with a constant (read-write version) |
| CSectionReader | Section reader class |
| CSectionWriter | Section writer class |
| CShiftMap | Shifts a map with a constant |
| CShiftWriteMap | Shifts a map with a constant (read-write version) |
| CSimpleBucketHeap | Simplified bucket heap data structure |
| ►CSimplePath | A structure for representing directed paths in a digraph |
| CArcIt | Iterator class to iterate on the arcs of the paths |
| CSkeletonSolverBase | A skeleton class to implement LP/MIP solver base interface |
| CSmartArcSet | Digraph using a node set of another digraph or graph and an own arc set |
| ►CSmartBpGraph | A smart undirected bipartite graph class |
| CSnapshot | Class to make a snapshot of the graph and to restore it later |
| ►CSmartDigraph | A smart directed graph class |
| CSnapshot | Class to make a snapshot of the digraph and to restore it later |
| CSmartEdgeSet | Graph using a node set of another digraph or graph and an own edge set |
| ►CSmartGraph | A smart undirected graph class |
| CSnapshot | Class to make a snapshot of the graph and to restore it later |
| CSoplexLp | Interface for the SOPLEX solver |
| CSourceMap | Map of the source nodes of arcs in a digraph |
| CSparseMap | Map type based on std::map |
| ►CSplitNodes | Adaptor class for splitting the nodes of a digraph |
| CCombinedArcMap | Arc map combined from an arc map and a node map of the original digraph |
| CCombinedNodeMap | Node map combined from two original node maps |
| CStaticDigraph | A static directed graph class |
| ►CStaticPath | A structure for representing directed paths in a digraph |
| CArcIt | Iterator class to iterate on the arcs of the paths |
| CSubDigraph | Adaptor class for hiding nodes and arcs in a digraph |
| CSubGraph | Adaptor class for hiding nodes and edges in an undirected graph |
| CSubMap | Difference of two maps |
| ►CSuurballe | Algorithm for finding arc-disjoint paths between two nodes having minimum total length |
| CSetFlowMap | Named parameter for setting FlowMap type |
| CSetHeap | Named parameter for setting Heap and HeapCrossRef types |
| CSetPath | Named parameter for setting Path type |
| CSetPotentialMap | Named parameter for setting PotentialMap type |
| CSuurballeDefaultTraits | Default traits class of Suurballe algorithm |
| CTargetMap | 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 | 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 |
| CTrueMap | Constant true map |
| ►CUndirector | Adaptor class for viewing a digraph as an undirected graph |
| CCombinedArcMap | Arc map combined from two original arc maps |
| CUnionFind | A Union-Find data structure implementation |
| ►CUnionFindEnum | A Union-Find data structure implementation which is able to enumerate the components |
| CClassIt | LEMON style iterator for the representant items |
| CItemIt | LEMON style iterator for the items of a component |
1.9.8