| ▼Noperations_research | Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License |
| CAnnotatedGraphBuildManager | |
| CArcFunctorOrderingByTailAndHead | |
| CArcIndexOrderingByTailNode | Logically this class should be defined inside OptimizeGraphLayout, but compilation fails if we do that because C++98 doesn't allow instantiation of member templates with function-scoped types as template parameters, which in turn is because those function-scoped types lack linkage |
| CBronKerboschAlgorithm | Implements the Bron-Kerbosch algorithm for finding maximal cliques |
| CChristofidesPathSolver | |
| CConnectedComponents | Template class implementing a Union-Find algorithm with path compression for maintaining the connected components of a graph |
| CCostValueCycleHandler | |
| ▼CEbertGraph | Forward declarations |
| CIncomingArcIterator | Iterator class for traversing the incoming arcs associated to a given node |
| COutgoingOrOppositeIncomingArcIterator | Iterator class for traversing the arcs incident to a given node in the graph |
| ▼CEbertGraphBase | A template for the base class that holds the functionality that exists in common between the EbertGraph<> template and the ForwardEbertGraph<> template |
| CCycleHandlerForAnnotatedArcs | |
| CElementIterator | |
| CForwardEbertGraph | A forward-star-only graph representation for greater efficiency in those algorithms that don't need reverse arcs |
| ▼CForwardStaticGraph | |
| CCycleHandlerForAnnotatedArcs | |
| CGenericMaxFlow | Forward declaration |
| CGenericMinCostFlow | Forward declaration |
| Cgraph_traits | Traits for EbertGraphBase types, for use in testing and clients that work with both forward-only and forward/reverse graphs |
| Cgraph_traits< ForwardEbertGraph< NodeIndexType, ArcIndexType > > | |
| Cgraph_traits< ForwardStaticGraph< NodeIndexType, ArcIndexType > > | |
| CGraphs | Since StarGraph does not have exactly the same interface as the other graphs, we define a correspondence there |
| CGraphs< operations_research::StarGraph > | |
| CHamiltonianPathSolver | |
| CLatticeMemoryManager | The Dynamic Programming (DP) algorithm memorizes the values f(set, node) for node in set, for all the subsets of cardinality <= max_card_ |
| ▼CLinearSumAssignment | This class does not take ownership of its underlying graph |
| CBipartiteLeftNodeIterator | |
| CMaxFlow | Default instance MaxFlow that uses StarGraph |
| CMaxFlowStatusClass | We want an enum for the Status of a max flow run, and we want this enum to be scoped under GenericMaxFlow<> |
| CMinCostFlow | Default MinCostFlow instance that uses StarGraph |
| CMinCostFlowBase | Different statuses for a solved problem |
| CPermutationIndexComparisonByArcHead | |
| CPriorityQueueWithRestrictedPush | Specific but efficient priority queue implementation |
| CPruningHamiltonianSolver | |
| CSet | |
| CSetRangeIterator | An iterator for sets of increasing corresponding values that have the same cardinality |
| CSetRangeWithCardinality | |
| CSimpleMaxFlow | A simple and efficient max-cost flow interface |
| CSimpleMinCostFlow | A simple and efficient min-cost flow interface |
| ▼CStarGraphBase | |
| CArcIterator | Iterator class for traversing the arcs in the graph |
| CNodeIterator | Iterator class for traversing all the nodes in the graph |
| COutgoingArcIterator | Iterator class for traversing the outgoing arcs associated to a given node |
| CTailArrayManager | |
| ▼Nutil | Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License |
| CBaseGraph | Base class of all Graphs implemented here |
| ▼CCompleteBipartiteGraph | CompleteBipartiteGraph implementation ------------------------------------— Nodes and arcs are implicit and not stored |
| COutgoingArcIterator | |
| CCompleteGraph | CompleteGraph implementation ---------------------------------------------— Nodes and arcs are implicit and not stored |
| ▼CListGraph | Basic graph implementation without reverse arc |
| COutgoingArcIterator | |
| COutgoingHeadIterator | |
| ▼CReverseArcListGraph | Extends the ListGraph by also storing the reverse arcs |
| CIncomingArcIterator | |
| COppositeIncomingArcIterator | |
| COutgoingArcIterator | |
| COutgoingHeadIterator | |
| COutgoingOrOppositeIncomingArcIterator | |
| ▼CReverseArcMixedGraph | This graph is a mix between the ReverseArcListGraph and the ReverseArcStaticGraph |
| CIncomingArcIterator | |
| COppositeIncomingArcIterator | |
| COutgoingArcIterator | |
| COutgoingOrOppositeIncomingArcIterator | |
| ▼CReverseArcStaticGraph | StaticGraph with reverse arc |
| CIncomingArcIterator | |
| COppositeIncomingArcIterator | |
| COutgoingArcIterator | |
| COutgoingOrOppositeIncomingArcIterator | |
| ▼CStaticGraph | Most efficient implementation of a graph without reverse arcs: |
| COutgoingArcIterator | |
| CSVector | Forward declaration |
| ▼CUndirectedAdjacencyListsOfDirectedGraph | This can be used to view a directed graph (that supports reverse arcs) from graph.h as un undirected graph: operator[](node) returns a pseudo-container that iterates over all nodes adjacent to "node" (from outgoing or incoming arcs) |
| CAdjacencyListIterator | |
| CConnectedComponentsFinder | Usage: ConnectedComponentsFinder<MyNodeType> cc; cc.AddNode(node1); cc.AddNode(node2); cc.AddEdge(node1, node2); .. |
| CDenseConnectedComponentsFinder | NOTE(user): The rest of the functions below should also be in namespace util, but for historical reasons it hasn't been done yet |
| CSccCounterOutput | A simple custom output class that just counts the number of SCC |