C++ Reference
C++ Reference: Graph
- a -
- ArcIndex : EbertGraph< NodeIndexType, ArcIndexType >, ForwardEbertGraph< NodeIndexType, ArcIndexType >, ForwardStaticGraph< NodeIndexType, ArcIndexType >, GenericMaxFlow< Graph >, GenericMinCostFlow< Graph, ArcFlowType, ArcScaledCostType >, Graphs< Graph >, Graphs< operations_research::StarGraph >, LinearSumAssignment< GraphType >, BaseGraph< NodeIndexType, ArcIndexType, HasReverseArcs >
- ArcIndexArray : GenericMaxFlow< Graph >, GenericMinCostFlow< Graph, ArcFlowType, ArcScaledCostType >
- ArcIterator : UndirectedAdjacencyListsOfDirectedGraph< Graph >
- c -
- CliqueCallback : BronKerboschAlgorithm< NodeIndex >
- const_iterator : BeginEndWrapper< Iterator >
- d -
- difference_type : IntegerRangeIterator< IntegerType >, ListGraph< NodeIndexType, ArcIndexType >::OutgoingHeadIterator
- g -
- i -
- IncomingArcIterator : GenericMaxFlow< Graph >
- Integer : HamiltonianPathSolver< CostType, CostFunction >, PruningHamiltonianSolver< CostType, CostFunction >
- IntegerType : Set< Integer >, SetRangeIterator< SetRange >
- IsArcCallback : BronKerboschAlgorithm< NodeIndex >
- iterator_category : IntegerRangeIterator< IntegerType >, ListGraph< NodeIndexType, ArcIndexType >::OutgoingHeadIterator
- m -
- Map : ConnectedComponentsTypeHelper< T, CompareOrHashT >, ConnectedComponentsTypeHelper< T, CompareOrHashT >::SelectContainer< U, E >, ConnectedComponentsTypeHelper< T, CompareOrHashT >::SelectContainer< U, absl::enable_if_t< std::is_integral< decltype(std::declval< const U & >()(std::declval< const T & >()))>::value > >
- n -
- NodeHeight : GenericMaxFlow< Graph >
- NodeHeightArray : GenericMaxFlow< Graph >
- NodeIndex : EbertGraph< NodeIndexType, ArcIndexType >, ForwardEbertGraph< NodeIndexType, ArcIndexType >, ForwardStaticGraph< NodeIndexType, ArcIndexType >, GenericMaxFlow< Graph >, GenericMinCostFlow< Graph, ArcFlowType, ArcScaledCostType >, Graphs< Graph >, Graphs< operations_research::StarGraph >, LinearSumAssignment< GraphType >, BaseGraph< NodeIndexType, ArcIndexType, HasReverseArcs >
- NodeSet : HamiltonianPathSolver< CostType, CostFunction >, PruningHamiltonianSolver< CostType, CostFunction >
- o -
- OutgoingArcIterator : GenericMaxFlow< Graph >, GenericMinCostFlow< Graph, ArcFlowType, ArcScaledCostType >
- OutgoingOrOppositeIncomingArcIterator : GenericMaxFlow< Graph >, GenericMinCostFlow< Graph, ArcFlowType, ArcScaledCostType >
- p -
- pointer : IntegerRangeIterator< IntegerType >, ListGraph< NodeIndexType, ArcIndexType >::OutgoingHeadIterator
- r -
- reference : IntegerRangeIterator< IntegerType >, ListGraph< NodeIndexType, ArcIndexType >::OutgoingHeadIterator
- s -
- Set : ConnectedComponentsTypeHelper< T, CompareOrHashT >::SelectContainer< U, E >, ConnectedComponentsTypeHelper< T, CompareOrHashT >::SelectContainer< U, absl::enable_if_t< std::is_integral< decltype(std::declval< const U & >()(std::declval< const T & >()))>::value > >, ConnectedComponentsTypeHelper< T, CompareOrHashT >
- SetType : SetRangeIterator< SetRange >, SetRangeWithCardinality< Set >