Class Hierarchy

Go to the graphical class hierarchy

This inheritance list is sorted roughly, but not completely, alphabetically:

[detail level 12]

CArcFunctorOrderingByTailAndHead< GraphType >
CArcIndexOrderingByTailNode< GraphType >
►CArcIterator
CUndirectedAdjacencyListsOfDirectedGraph< Graph >::AdjacencyListIterator
CStarGraphBase< NodeIndexType, ArcIndexType, DerivedGraph >::ArcIterator
►CArrayIndexCycleHandler
CForwardStaticGraph< NodeIndexType, ArcIndexType >::CycleHandlerForAnnotatedArcs
CBaseGraph< NodeIndexType, ArcIndexType, HasReverseArcs >
►CBaseGraph< int32, int32, false >
CCompleteBipartiteGraph< NodeIndexType, ArcIndexType >
CCompleteGraph< NodeIndexType, ArcIndexType >
CListGraph< NodeIndexType, ArcIndexType >
CStaticGraph< NodeIndexType, ArcIndexType >
►CBaseGraph< int32, int32, true >
CReverseArcListGraph< NodeIndexType, ArcIndexType >
CReverseArcMixedGraph< NodeIndexType, ArcIndexType >
CReverseArcStaticGraph< NodeIndexType, ArcIndexType >
CBeginEndReverseIteratorWrapper< Container >
CBeginEndWrapper< Iterator >
►CBeginEndWrapper< IntegerRangeIterator< IntegerType > >
CIntegerRange< IntegerType >
CLinearSumAssignment< GraphType >::BipartiteLeftNodeIterator
CBronKerboschAlgorithm< NodeIndex >
CChristofidesPathSolver< CostType, ArcIndex, NodeIndex, CostFunction >
CConnectedComponentsFinder< T, CompareOrHashT >
CConnectedComponentsTypeHelper< T, CompareOrHashT >
CConnectedComponentsTypeHelper< T, std::less< T > >
CDenseConnectedComponentsFinder
CEbertGraph< NodeIndexType, ArcIndexType >
CElementIterator< Set >
CForwardEbertGraph< NodeIndexType, ArcIndexType >
CForwardStaticGraph< NodeIndexType, ArcIndexType >
CGenericMaxFlow< Graph >
►CGenericMaxFlow< StarGraph >
CMaxFlow
CGenericMaxFlow< util::ReverseArcStaticGraph >
CGenericMinCostFlow< Graph, ArcFlowType, ArcScaledCostType >
►CGenericMinCostFlow< StarGraph >
CMinCostFlow
Cgraph_traits< GraphType >
Cgraph_traits< ForwardEbertGraph< NodeIndexType, ArcIndexType > >
Cgraph_traits< ForwardStaticGraph< NodeIndexType, ArcIndexType > >
CGraphBuilderFromArcs< GraphType, is_dynamic >
►CGraphBuilderFromArcs< GraphType, graph_traits< GraphType >::is_dynamic >
CAnnotatedGraphBuildManager< GraphType >
CGraphBuilderFromArcs< GraphType, true >
CGraphs< Graph >
CGraphs< operations_research::StarGraph >
CHamiltonianPathSolver< CostType, CostFunction >
CHeldWolfeCrowderEvaluator< CostType, CostFunction >
CEbertGraph< NodeIndexType, ArcIndexType >::IncomingArcIterator
CMutableVectorIteration< T >::Iterator
►Citerator
CIntegerRangeIterator< IntegerType >
CLatticeMemoryManager< Set, CostType >
CLatticeMemoryManager< operations_research::Set, CostType >
CLinearSumAssignment< GraphType >
CMaxFlowStatusClass
►CMessage
CPROTOBUF_FINAL
►CMinCostFlowBase
CSimpleMinCostFlow
CMutableVectorIteration< T >
CStarGraphBase< NodeIndexType, ArcIndexType, DerivedGraph >::NodeIterator
►CReverseArcMixedGraph< NodeIndexType, ArcIndexType >::OppositeIncomingArcIterator
CReverseArcMixedGraph< NodeIndexType, ArcIndexType >::IncomingArcIterator
►CReverseArcListGraph< NodeIndexType, ArcIndexType >::OppositeIncomingArcIterator
CReverseArcListGraph< NodeIndexType, ArcIndexType >::IncomingArcIterator
►CReverseArcStaticGraph< NodeIndexType, ArcIndexType >::OppositeIncomingArcIterator
CReverseArcStaticGraph< NodeIndexType, ArcIndexType >::IncomingArcIterator
CReverseArcMixedGraph< NodeIndexType, ArcIndexType >::OutgoingArcIterator
CCompleteBipartiteGraph< NodeIndexType, ArcIndexType >::OutgoingArcIterator
CReverseArcStaticGraph< NodeIndexType, ArcIndexType >::OutgoingArcIterator
CReverseArcListGraph< NodeIndexType, ArcIndexType >::OutgoingArcIterator
CStarGraphBase< NodeIndexType, ArcIndexType, DerivedGraph >::OutgoingArcIterator
CListGraph< NodeIndexType, ArcIndexType >::OutgoingArcIterator
CStaticGraph< NodeIndexType, ArcIndexType >::OutgoingArcIterator
CListGraph< NodeIndexType, ArcIndexType >::OutgoingHeadIterator
CReverseArcListGraph< NodeIndexType, ArcIndexType >::OutgoingHeadIterator
CReverseArcMixedGraph< NodeIndexType, ArcIndexType >::OutgoingOrOppositeIncomingArcIterator
CReverseArcStaticGraph< NodeIndexType, ArcIndexType >::OutgoingOrOppositeIncomingArcIterator
CEbertGraph< NodeIndexType, ArcIndexType >::OutgoingOrOppositeIncomingArcIterator
CReverseArcListGraph< NodeIndexType, ArcIndexType >::OutgoingOrOppositeIncomingArcIterator
►CPermutationCycleHandler
CCostValueCycleHandler< ArcIndexType >
CEbertGraphBase< NodeIndexType, ArcIndexType, DerivedGraph >::CycleHandlerForAnnotatedArcs
CPermutationIndexComparisonByArcHead< NodeIndexType, ArcIndexType >
CPriorityQueueWithRestrictedPush< Element, IntegerPriority >
CPriorityQueueWithRestrictedPush< NodeIndex, NodeHeight >
CPruningHamiltonianSolver< CostType, CostFunction >
CSccCounterOutput< NodeIndex >
CConnectedComponentsTypeHelper< T, CompareOrHashT >::SelectContainer< U, E >
CConnectedComponentsTypeHelper< T, CompareOrHashT >::SelectContainer< U, absl::enable_if_t< std::is_integral< decltype(std::declval< const U & >()(std::declval< const T & >()))>::value > >
CSet< Integer >
CSetRangeIterator< SetRange >
CSetRangeWithCardinality< Set >
CSimpleMaxFlow
►CStarGraphBase< NodeIndexType, ArcIndexType, DerivedGraph >
CEbertGraphBase< NodeIndexType, ArcIndexType, DerivedGraph >
CStronglyConnectedComponentsFinder< NodeIndex, Graph, SccOutput >
CSVector< T >
CSVector< int32 >
CTableStruct_ortools_2fgraph_2fflow_5fproblem_2eproto
CTailArrayBuilder< GraphType, has_reverse_arcs >
CTailArrayBuilder< GraphType, false >
CTailArrayManager< GraphType >
CTailArrayReleaser< GraphType, has_reverse_arcs >
CTailArrayReleaser< GraphType, false >
CTravelingSalesmanLowerBoundParameters
►Ctrue_type
Cis_proto_enum< ::operations_research::FlowModel_ProblemType >
CUndirectedAdjacencyListsOfDirectedGraph< Graph >
CVolgenantJonkerEvaluator< CostType >