diff --git a/docs/cpp_graph.tag b/docs/cpp_graph.tag index ab1bac9d57..447cbc479d 100644 --- a/docs/cpp_graph.tag +++ b/docs/cpp_graph.tag @@ -54,12 +54,8 @@ /Users/lperron/Work/or-tools/ortools/graph/ connected__components_8h DenseConnectedComponentsFinder - internal::ConnectedComponentsTypeHelper - internal::ConnectedComponentsTypeHelper::SelectContainer - internal::ConnectedComponentsTypeHelper::SelectContainer< U, absl::enable_if_t< std::is_integral< decltype(std::declval< const U & >()(std::declval< const T & >()))>::value > > ConnectedComponentsFinder util - internal std::vector< int > GetConnectedComponents @@ -98,17 +94,10 @@ operations_research::graph_traits operations_research::graph_traits< ForwardEbertGraph< NodeIndexType, ArcIndexType > > operations_research::graph_traits< ForwardStaticGraph< NodeIndexType, ArcIndexType > > - operations_research::or_internal::TailArrayBuilder - operations_research::or_internal::TailArrayBuilder< GraphType, false > - operations_research::or_internal::TailArrayReleaser - operations_research::or_internal::TailArrayReleaser< GraphType, false > operations_research::TailArrayManager operations_research::ArcFunctorOrderingByTailAndHead - operations_research::or_internal::GraphBuilderFromArcs - operations_research::or_internal::GraphBuilderFromArcs< GraphType, true > operations_research::AnnotatedGraphBuildManager operations_research - operations_research::or_internal int32 NodeIndex @@ -966,7 +955,6 @@ operations_research::AnnotatedGraphBuildManager classoperations__research_1_1AnnotatedGraphBuildManager.html - GraphBuilderFromArcs< GraphType, graph_traits< GraphType >::is_dynamic > AnnotatedGraphBuildManager @@ -974,25 +962,11 @@ a54e58efb7e00c121962f0642e086ff62 (typename GraphType::NodeIndex num_nodes, typename GraphType::ArcIndex num_arcs, bool sort_arcs) - - GraphType::ArcIndex - AddArc - classoperations__research_1_1or__internal_1_1GraphBuilderFromArcs.html - ac8c490f6e4ec383c92799f17ddde40e1 - (typename GraphType::NodeIndex tail, typename GraphType::NodeIndex head) - - - GraphType * - Graph - classoperations__research_1_1or__internal_1_1GraphBuilderFromArcs.html - a63eda0d830f2a9f145e3aa65e7b80bae - (PermutationCycleHandler< typename GraphType::ArcIndex > *client_cycle_handler) - operations_research::ArcFunctorOrderingByTailAndHead classoperations__research_1_1ArcFunctorOrderingByTailAndHead.html - GraphType + ArcFunctorOrderingByTailAndHead @@ -2386,28 +2360,6 @@ () const - - internal::ConnectedComponentsTypeHelper - structinternal_1_1ConnectedComponentsTypeHelper.html - T - CompareOrHashT - internal::ConnectedComponentsTypeHelper::SelectContainer - internal::ConnectedComponentsTypeHelper::SelectContainer< U, absl::enable_if_t< std::is_integral< decltype(std::declval< const U & >()(std::declval< const T & >()))>::value > > - - typename SelectContainer< CompareOrHashT >::Set - Set - structinternal_1_1ConnectedComponentsTypeHelper.html - a9cd35864d49655496e8299033909c931 - - - - typename SelectContainer< CompareOrHashT >::Map - Map - structinternal_1_1ConnectedComponentsTypeHelper.html - ae62844a121f82b3e7f7b43bb7eda50e3 - - - operations_research::CostValueCycleHandler classoperations__research_1_1CostValueCycleHandler.html @@ -6505,91 +6457,6 @@ - - operations_research::or_internal::GraphBuilderFromArcs - classoperations__research_1_1or__internal_1_1GraphBuilderFromArcs.html - GraphType - is_dynamic - - - GraphBuilderFromArcs - classoperations__research_1_1or__internal_1_1GraphBuilderFromArcs.html - a50b4ce116fea3019a46e0d4d502c3d4a - (typename GraphType::NodeIndex max_num_nodes, typename GraphType::ArcIndex max_num_arcs, bool sort_arcs) - - - GraphType::ArcIndex - AddArc - classoperations__research_1_1or__internal_1_1GraphBuilderFromArcs.html - ac8c490f6e4ec383c92799f17ddde40e1 - (typename GraphType::NodeIndex tail, typename GraphType::NodeIndex head) - - - GraphType * - Graph - classoperations__research_1_1or__internal_1_1GraphBuilderFromArcs.html - a63eda0d830f2a9f145e3aa65e7b80bae - (PermutationCycleHandler< typename GraphType::ArcIndex > *client_cycle_handler) - - - - GraphBuilderFromArcs< GraphType, graph_traits< GraphType >::is_dynamic > - classoperations__research_1_1or__internal_1_1GraphBuilderFromArcs.html - - - GraphBuilderFromArcs - classoperations__research_1_1or__internal_1_1GraphBuilderFromArcs.html - a50b4ce116fea3019a46e0d4d502c3d4a - (typename GraphType::NodeIndex max_num_nodes, typename GraphType::ArcIndex max_num_arcs, bool sort_arcs) - - - GraphType::ArcIndex - AddArc - classoperations__research_1_1or__internal_1_1GraphBuilderFromArcs.html - ac8c490f6e4ec383c92799f17ddde40e1 - (typename GraphType::NodeIndex tail, typename GraphType::NodeIndex head) - - - GraphType * - Graph - classoperations__research_1_1or__internal_1_1GraphBuilderFromArcs.html - a63eda0d830f2a9f145e3aa65e7b80bae - (PermutationCycleHandler< typename GraphType::ArcIndex > *client_cycle_handler) - - - - operations_research::or_internal::GraphBuilderFromArcs< GraphType, true > - classoperations__research_1_1or__internal_1_1GraphBuilderFromArcs_3_01GraphType_00_01true_01_4.html - - - - GraphBuilderFromArcs - classoperations__research_1_1or__internal_1_1GraphBuilderFromArcs_3_01GraphType_00_01true_01_4.html - a64d3d75bc8251d0ad57b871d5fe4218d - (typename GraphType::NodeIndex max_num_nodes, typename GraphType::ArcIndex max_num_arcs, bool sort_arcs) - - - bool - Reserve - classoperations__research_1_1or__internal_1_1GraphBuilderFromArcs_3_01GraphType_00_01true_01_4.html - a5d791b7f9699217ab04fd210eb2fbc0c - (const typename GraphType::NodeIndex new_max_num_nodes, const typename GraphType::ArcIndex new_max_num_arcs) - - - GraphType::ArcIndex - AddArc - classoperations__research_1_1or__internal_1_1GraphBuilderFromArcs_3_01GraphType_00_01true_01_4.html - ad46ec98800eaa24cf5938a70dd9cdec0 - (const typename GraphType::NodeIndex tail, const typename GraphType::NodeIndex head) - - - GraphType * - Graph - classoperations__research_1_1or__internal_1_1GraphBuilderFromArcs_3_01GraphType_00_01true_01_4.html - a0d5cb434a87d8d954377759e77439590 - (PermutationCycleHandler< typename GraphType::ArcIndex > *client_cycle_handler) - - operations_research::Graphs structoperations__research_1_1Graphs.html @@ -10693,45 +10560,6 @@ - - internal::ConnectedComponentsTypeHelper::SelectContainer - structinternal_1_1ConnectedComponentsTypeHelper_1_1SelectContainer.html - U - E - - std::set< T, CompareOrHashT > - Set - structinternal_1_1ConnectedComponentsTypeHelper_1_1SelectContainer.html - a5dde23c75f6bb978eeb813de8c33e45c - - - - std::map< T, int, CompareOrHashT > - Map - structinternal_1_1ConnectedComponentsTypeHelper_1_1SelectContainer.html - a0ed154f290edff8b152633553a5448d3 - - - - - internal::ConnectedComponentsTypeHelper::SelectContainer< U, absl::enable_if_t< std::is_integral< decltype(std::declval< const U & >()(std::declval< const T & >()))>::value > > - structinternal_1_1ConnectedComponentsTypeHelper_1_1SelectContainer_3_01U_00_01absl_1_1enable__if709ff45ae30ec82cc2c06c401b5d6cb4.html - - - absl::flat_hash_set< T, CompareOrHashT > - Set - structinternal_1_1ConnectedComponentsTypeHelper_1_1SelectContainer_3_01U_00_01absl_1_1enable__if709ff45ae30ec82cc2c06c401b5d6cb4.html - a439a1cb9d2121271a7db8e24700b8377 - - - - absl::flat_hash_map< T, int, CompareOrHashT > - Map - structinternal_1_1ConnectedComponentsTypeHelper_1_1SelectContainer_3_01U_00_01absl_1_1enable__if709ff45ae30ec82cc2c06c401b5d6cb4.html - a59d3484159e1af75544ad7966e796f31 - - - operations_research::Set classoperations__research_1_1Set.html @@ -12912,52 +12740,6 @@ () - - operations_research::or_internal::TailArrayBuilder - structoperations__research_1_1or__internal_1_1TailArrayBuilder.html - - has_reverse_arcs - - - TailArrayBuilder - structoperations__research_1_1or__internal_1_1TailArrayBuilder.html - a28b7688fafdc836ef6a73745a0fce436 - (GraphType *unused_graph) - - - bool - BuildTailArray - structoperations__research_1_1or__internal_1_1TailArrayBuilder.html - a589594565d8036122b077b6cd073a78b - () const - - - - operations_research::or_internal::TailArrayBuilder< GraphType, false > - structoperations__research_1_1or__internal_1_1TailArrayBuilder_3_01GraphType_00_01false_01_4.html - - - - TailArrayBuilder - structoperations__research_1_1or__internal_1_1TailArrayBuilder_3_01GraphType_00_01false_01_4.html - a24a7428dbeb51c80bd4286717a76a6bd - (GraphType *graph) - - - bool - BuildTailArray - structoperations__research_1_1or__internal_1_1TailArrayBuilder_3_01GraphType_00_01false_01_4.html - aa11235f108a5e901782389445d5142e6 - () const - - - GraphType *const - graph_ - structoperations__research_1_1or__internal_1_1TailArrayBuilder_3_01GraphType_00_01false_01_4.html - ab7e50258cbade6b04cce77b445085dca - - - operations_research::TailArrayManager classoperations__research_1_1TailArrayManager.html @@ -12984,52 +12766,6 @@ () const - - operations_research::or_internal::TailArrayReleaser - structoperations__research_1_1or__internal_1_1TailArrayReleaser.html - - has_reverse_arcs - - - TailArrayReleaser - structoperations__research_1_1or__internal_1_1TailArrayReleaser.html - aeff559d3c44a19d42a1f33813c6c362d - (GraphType *unused_graph) - - - void - ReleaseTailArray - structoperations__research_1_1or__internal_1_1TailArrayReleaser.html - a5a7ac35808765a8abc9fd2e84ea6ea72 - () const - - - - operations_research::or_internal::TailArrayReleaser< GraphType, false > - structoperations__research_1_1or__internal_1_1TailArrayReleaser_3_01GraphType_00_01false_01_4.html - - - - TailArrayReleaser - structoperations__research_1_1or__internal_1_1TailArrayReleaser_3_01GraphType_00_01false_01_4.html - a15337365a0acc879ac0b8644367d49cd - (GraphType *graph) - - - void - ReleaseTailArray - structoperations__research_1_1or__internal_1_1TailArrayReleaser_3_01GraphType_00_01false_01_4.html - a32810896d711a4ee8b476a744e0df3b2 - () const - - - GraphType *const - graph_ - structoperations__research_1_1or__internal_1_1TailArrayReleaser_3_01GraphType_00_01false_01_4.html - a2846e22b5bbaabf4c4c6079fb3f91541 - - - util::UndirectedAdjacencyListsOfDirectedGraph classutil_1_1UndirectedAdjacencyListsOfDirectedGraph.html @@ -13057,15 +12793,9 @@ (int node) const - - internal - namespaceinternal.html - internal::ConnectedComponentsTypeHelper - operations_research namespaceoperations__research.html - operations_research::or_internal operations_research::AnnotatedGraphBuildManager operations_research::ArcFunctorOrderingByTailAndHead operations_research::ArcIndexOrderingByTailNode @@ -13324,16 +13054,6 @@ (int node_count, int start_node, int end_node, std::function< int64(int, int)> graph, std::function< int64(int)> heuristic, int64 disconnected_distance, std::vector< int > *nodes) - - operations_research::or_internal - namespaceoperations__research_1_1or__internal.html - operations_research::or_internal::GraphBuilderFromArcs - operations_research::or_internal::GraphBuilderFromArcs< GraphType, true > - operations_research::or_internal::TailArrayBuilder - operations_research::or_internal::TailArrayBuilder< GraphType, false > - operations_research::or_internal::TailArrayReleaser - operations_research::or_internal::TailArrayReleaser< GraphType, false > - util namespaceutil.html diff --git a/docs/cpp_graph/annotated.html b/docs/cpp_graph/annotated.html index 9374cf3f1d..a4c1b320d9 100644 --- a/docs/cpp_graph/annotated.html +++ b/docs/cpp_graph/annotated.html @@ -42,94 +42,83 @@
Here are the classes, structs, unions and interfaces with brief descriptions:
[detail level 123]
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
 ▼Ninternal
 ▼CConnectedComponentsTypeHelperA helper to deduce the type of map to use depending on whether CompareOrHashT is a comparator or a hasher (prefer the latter)
 CSelectContainerSFINAE trait to detect hash functors and select unordered containers if so, and ordered containers otherwise (= by default)
 CSelectContainer< U, absl::enable_if_t< std::is_integral< decltype(std::declval< const U & >()(std::declval< const T & >()))>::value > >The expression inside decltype is basically saying that "H(x)" is well-formed, where H is an instance of U and x is an instance of T, and is a value of integral type
 ▼Noperations_researchLicensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License
 ▼Nor_internal
 CGraphBuilderFromArcsThe GraphBuilderFromArcs class template is not expected to be used by clients
 CGraphBuilderFromArcs< GraphType, true >Trivial delegating specialization for dynamic graphs
 CTailArrayBuilderThe TailArrayBuilder class template is not expected to be used by clients
 CTailArrayBuilder< GraphType, false >The TailArrayBuilder for graphs without reverse arcs calls the appropriate method on the graph from the TailArrayBuilder constructor
 CTailArrayReleaserThe TailArrayReleaser class template is not expected to be used by clients
 CTailArrayReleaser< GraphType, false >The TailArrayReleaser for graphs without reverse arcs calls the appropriate method on the graph from the TailArrayReleaser constructor
 CAnnotatedGraphBuildManager
 CArcFunctorOrderingByTailAndHead
 CArcIndexOrderingByTailNodeLogically 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
 CBronKerboschAlgorithmImplements the Bron-Kerbosch algorithm for finding maximal cliques
 CChristofidesPathSolver
 CConnectedComponentsTemplate class implementing a Union-Find algorithm with path compression for maintaining the connected components of a graph
 CCostValueCycleHandler
 ▼CEbertGraphForward declarations
 CIncomingArcIteratorIterator class for traversing the incoming arcs associated to a given node
 COutgoingOrOppositeIncomingArcIteratorIterator class for traversing the arcs incident to a given node in the graph
 ▼CEbertGraphBaseA template for the base class that holds the functionality that exists in common between the EbertGraph<> template and the ForwardEbertGraph<> template
 CCycleHandlerForAnnotatedArcs
 CElementIterator
 CForwardEbertGraphA forward-star-only graph representation for greater efficiency in those algorithms that don't need reverse arcs
 ▼CForwardStaticGraph
 CCycleHandlerForAnnotatedArcs
 CGenericMaxFlowForward declaration
 CGenericMinCostFlowForward declaration
 Cgraph_traitsTraits 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 > >
 CGraphsSince StarGraph does not have exactly the same interface as the other graphs, we define a correspondence there
 CGraphs< operations_research::StarGraph >
 CHamiltonianPathSolver
 CLatticeMemoryManagerThe Dynamic Programming (DP) algorithm memorizes the values f(set, node) for node in set, for all the subsets of cardinality <= max_card_
 ▼CLinearSumAssignmentThis class does not take ownership of its underlying graph
 CBipartiteLeftNodeIterator
 CMaxFlowDefault instance MaxFlow that uses StarGraph
 CMaxFlowStatusClassWe want an enum for the Status of a max flow run, and we want this enum to be scoped under GenericMaxFlow<>
 CMinCostFlowDefault MinCostFlow instance that uses StarGraph
 CMinCostFlowBaseDifferent statuses for a solved problem
 CPermutationIndexComparisonByArcHead
 CPriorityQueueWithRestrictedPushSpecific but efficient priority queue implementation
 CPruningHamiltonianSolver
 CSet
 CSetRangeIteratorAn iterator for sets of increasing corresponding values that have the same cardinality
 CSetRangeWithCardinality
 CSimpleMaxFlowA simple and efficient max-cost flow interface
 CSimpleMinCostFlowA simple and efficient min-cost flow interface
 ▼CStarGraphBase
 CArcIteratorIterator class for traversing the arcs in the graph
 CNodeIteratorIterator class for traversing all the nodes in the graph
 COutgoingArcIteratorIterator class for traversing the outgoing arcs associated to a given node
 CTailArrayManager
 ▼NutilLicensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License
 CBaseGraphBase class of all Graphs implemented here
 ▼CCompleteBipartiteGraphCompleteBipartiteGraph implementation ------------------------------------— Nodes and arcs are implicit and not stored
 COutgoingArcIterator
 CCompleteGraphCompleteGraph implementation ---------------------------------------------— Nodes and arcs are implicit and not stored
 ▼CListGraphBasic graph implementation without reverse arc
 COutgoingArcIterator
 COutgoingHeadIterator
 ▼CReverseArcListGraphExtends the ListGraph by also storing the reverse arcs
 CIncomingArcIterator
 COppositeIncomingArcIterator
 COutgoingArcIterator
 COutgoingHeadIterator
 COutgoingOrOppositeIncomingArcIterator
 ▼CReverseArcMixedGraphThis graph is a mix between the ReverseArcListGraph and the ReverseArcStaticGraph
 CIncomingArcIterator
 COppositeIncomingArcIterator
 COutgoingArcIterator
 COutgoingOrOppositeIncomingArcIterator
 ▼CReverseArcStaticGraphStaticGraph with reverse arc
 CIncomingArcIterator
 COppositeIncomingArcIterator
 COutgoingArcIterator
 COutgoingOrOppositeIncomingArcIterator
 ▼CStaticGraphMost efficient implementation of a graph without reverse arcs:
 COutgoingArcIterator
 CSVectorForward declaration
 ▼CUndirectedAdjacencyListsOfDirectedGraphThis 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
 CConnectedComponentsFinderUsage: ConnectedComponentsFinder<MyNodeType> cc; cc.AddNode(node1); cc.AddNode(node2); cc.AddEdge(node1, node2); ..
 CDenseConnectedComponentsFinderNOTE(user): The rest of the functions below should also be in namespace util, but for historical reasons it hasn't been done yet
 CSccCounterOutputA simple custom output class that just counts the number of SCC
 ▼Noperations_researchLicensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License
 CAnnotatedGraphBuildManager
 CArcFunctorOrderingByTailAndHead
 CArcIndexOrderingByTailNodeLogically 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
 CBronKerboschAlgorithmImplements the Bron-Kerbosch algorithm for finding maximal cliques
 CChristofidesPathSolver
 CConnectedComponentsTemplate class implementing a Union-Find algorithm with path compression for maintaining the connected components of a graph
 CCostValueCycleHandler
 ▼CEbertGraphForward declarations
 CIncomingArcIteratorIterator class for traversing the incoming arcs associated to a given node
 COutgoingOrOppositeIncomingArcIteratorIterator class for traversing the arcs incident to a given node in the graph
 ▼CEbertGraphBaseA template for the base class that holds the functionality that exists in common between the EbertGraph<> template and the ForwardEbertGraph<> template
 CCycleHandlerForAnnotatedArcs
 CElementIterator
 CForwardEbertGraphA forward-star-only graph representation for greater efficiency in those algorithms that don't need reverse arcs
 ▼CForwardStaticGraph
 CCycleHandlerForAnnotatedArcs
 CGenericMaxFlowForward declaration
 CGenericMinCostFlowForward declaration
 Cgraph_traitsTraits 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 > >
 CGraphsSince StarGraph does not have exactly the same interface as the other graphs, we define a correspondence there
 CGraphs< operations_research::StarGraph >
 CHamiltonianPathSolver
 CLatticeMemoryManagerThe Dynamic Programming (DP) algorithm memorizes the values f(set, node) for node in set, for all the subsets of cardinality <= max_card_
 ▼CLinearSumAssignmentThis class does not take ownership of its underlying graph
 CBipartiteLeftNodeIterator
 CMaxFlowDefault instance MaxFlow that uses StarGraph
 CMaxFlowStatusClassWe want an enum for the Status of a max flow run, and we want this enum to be scoped under GenericMaxFlow<>
 CMinCostFlowDefault MinCostFlow instance that uses StarGraph
 CMinCostFlowBaseDifferent statuses for a solved problem
 CPermutationIndexComparisonByArcHead
 CPriorityQueueWithRestrictedPushSpecific but efficient priority queue implementation
 CPruningHamiltonianSolver
 CSet
 CSetRangeIteratorAn iterator for sets of increasing corresponding values that have the same cardinality
 CSetRangeWithCardinality
 CSimpleMaxFlowA simple and efficient max-cost flow interface
 CSimpleMinCostFlowA simple and efficient min-cost flow interface
 ▼CStarGraphBase
 CArcIteratorIterator class for traversing the arcs in the graph
 CNodeIteratorIterator class for traversing all the nodes in the graph
 COutgoingArcIteratorIterator class for traversing the outgoing arcs associated to a given node
 CTailArrayManager
 ▼NutilLicensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License
 CBaseGraphBase class of all Graphs implemented here
 ▼CCompleteBipartiteGraphCompleteBipartiteGraph implementation ------------------------------------— Nodes and arcs are implicit and not stored
 COutgoingArcIterator
 CCompleteGraphCompleteGraph implementation ---------------------------------------------— Nodes and arcs are implicit and not stored
 ▼CListGraphBasic graph implementation without reverse arc
 COutgoingArcIterator
 COutgoingHeadIterator
 ▼CReverseArcListGraphExtends the ListGraph by also storing the reverse arcs
 CIncomingArcIterator
 COppositeIncomingArcIterator
 COutgoingArcIterator
 COutgoingHeadIterator
 COutgoingOrOppositeIncomingArcIterator
 ▼CReverseArcMixedGraphThis graph is a mix between the ReverseArcListGraph and the ReverseArcStaticGraph
 CIncomingArcIterator
 COppositeIncomingArcIterator
 COutgoingArcIterator
 COutgoingOrOppositeIncomingArcIterator
 ▼CReverseArcStaticGraphStaticGraph with reverse arc
 CIncomingArcIterator
 COppositeIncomingArcIterator
 COutgoingArcIterator
 COutgoingOrOppositeIncomingArcIterator
 ▼CStaticGraphMost efficient implementation of a graph without reverse arcs:
 COutgoingArcIterator
 CSVectorForward declaration
 ▼CUndirectedAdjacencyListsOfDirectedGraphThis 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
 CConnectedComponentsFinderUsage: ConnectedComponentsFinder<MyNodeType> cc; cc.AddNode(node1); cc.AddNode(node2); cc.AddEdge(node1, node2); ..
 CDenseConnectedComponentsFinderNOTE(user): The rest of the functions below should also be in namespace util, but for historical reasons it hasn't been done yet
 CSccCounterOutputA simple custom output class that just counts the number of SCC
diff --git a/docs/cpp_graph/classConnectedComponentsFinder.html b/docs/cpp_graph/classConnectedComponentsFinder.html index a949ba0ea0..ba95e1dc4e 100644 --- a/docs/cpp_graph/classConnectedComponentsFinder.html +++ b/docs/cpp_graph/classConnectedComponentsFinder.html @@ -73,7 +73,7 @@ Public Member Functions std::vector< std::vector< T > > FindConnectedComponents ()  Finds all the connected components and assigns them to components. More...
  -void FindConnectedComponents (std::vector< typename internal::ConnectedComponentsTypeHelper< T, CompareOrHashT >::Set > *components) +void FindConnectedComponents (std::vector< typename internal::ConnectedComponentsTypeHelper< T, CompareOrHashT >::Set > *components)   int GetNumberOfComponents () const  Returns the current number of connected components. More...
@@ -324,7 +324,7 @@ template<typename T , typename CompareOrHashT = std::less<T>> void ConnectedComponentsFinder< T, CompareOrHashT >::FindConnectedComponents ( - std::vector< typename internal::ConnectedComponentsTypeHelper< T, CompareOrHashT >::Set > *  + std::vector< typename internal::ConnectedComponentsTypeHelper< T, CompareOrHashT >::Set > *  components) diff --git a/docs/cpp_graph/classes.html b/docs/cpp_graph/classes.html index 549dce556c..0ce61f13d7 100644 --- a/docs/cpp_graph/classes.html +++ b/docs/cpp_graph/classes.html @@ -43,64 +43,61 @@
a | b | c | d | e | f | g | h | i | l | m | n | o | p | r | s | t | u
- - - - + + + + + - + + + - - - + + + - - + + + - + + + + - - - - - - + + - - + + + - - - - + + + + + - - - - - - - - - + + + + + + +
  a  
-		graph_traits< ForwardStaticGraph< NodeIndexType, ArcIndexType > > (operations_research)   ListGraph::OutgoingHeadIterator (util)   
GraphBuilderFromArcs (operations_research::or_internal)   ReverseArcListGraph::OutgoingHeadIterator (util)   
UndirectedAdjacencyListsOfDirectedGraph::AdjacencyListIterator (util)   GraphBuilderFromArcs< GraphType, true > (operations_research::or_internal)   EbertGraph::OutgoingOrOppositeIncomingArcIterator (operations_research)   
AnnotatedGraphBuildManager (operations_research)   Graphs (operations_research)   ReverseArcMixedGraph::OutgoingOrOppositeIncomingArcIterator (util)   
ArcFunctorOrderingByTailAndHead (operations_research)   Graphs< operations_research::StarGraph > (operations_research)   ReverseArcStaticGraph::OutgoingOrOppositeIncomingArcIterator (util)   
graph_traits (operations_research)   ReverseArcMixedGraph::OutgoingArcIterator (util)   
graph_traits< ForwardEbertGraph< NodeIndexType, ArcIndexType > > (operations_research)   StaticGraph::OutgoingArcIterator (util)   
UndirectedAdjacencyListsOfDirectedGraph::AdjacencyListIterator (util)   graph_traits< ForwardStaticGraph< NodeIndexType, ArcIndexType > > (operations_research)   CompleteBipartiteGraph::OutgoingArcIterator (util)   
AnnotatedGraphBuildManager (operations_research)   Graphs (operations_research)   ListGraph::OutgoingHeadIterator (util)   
ArcFunctorOrderingByTailAndHead (operations_research)   Graphs< operations_research::StarGraph > (operations_research)   ReverseArcListGraph::OutgoingHeadIterator (util)   
ArcIndexOrderingByTailNode (operations_research)   
  h  
-		ReverseArcListGraph::OutgoingOrOppositeIncomingArcIterator (util)   
StarGraphBase::ArcIterator (operations_research)   
  p  
-
EbertGraph::OutgoingOrOppositeIncomingArcIterator (operations_research)   
StarGraphBase::ArcIterator (operations_research)   ReverseArcMixedGraph::OutgoingOrOppositeIncomingArcIterator (util)   
  b  
-		HamiltonianPathSolver (operations_research)   
HamiltonianPathSolver (operations_research)   ReverseArcStaticGraph::OutgoingOrOppositeIncomingArcIterator (util)   
  i  
-		PermutationIndexComparisonByArcHead (operations_research)   
BaseGraph (util)   PriorityQueueWithRestrictedPush (operations_research)   
LinearSumAssignment::BipartiteLeftNodeIterator (operations_research)   ReverseArcListGraph::IncomingArcIterator (util)   PruningHamiltonianSolver (operations_research)   
BronKerboschAlgorithm (operations_research)   EbertGraph::IncomingArcIterator (operations_research)   
  r  
+		ReverseArcListGraph::OutgoingOrOppositeIncomingArcIterator (util)   
BaseGraph (util)   
  p  
LinearSumAssignment::BipartiteLeftNodeIterator (operations_research)   ReverseArcListGraph::IncomingArcIterator (util)   
BronKerboschAlgorithm (operations_research)   EbertGraph::IncomingArcIterator (operations_research)   PermutationIndexComparisonByArcHead (operations_research)   
  c  
-		ReverseArcStaticGraph::IncomingArcIterator (util)   
ReverseArcMixedGraph::IncomingArcIterator (util)   ReverseArcListGraph (util)   
ChristofidesPathSolver (operations_research)   MutableVectorIteration::Iterator   ReverseArcMixedGraph (util)   
ReverseArcStaticGraph::IncomingArcIterator (util)   PriorityQueueWithRestrictedPush (operations_research)   
ReverseArcMixedGraph::IncomingArcIterator (util)   PruningHamiltonianSolver (operations_research)   
ChristofidesPathSolver (operations_research)   MutableVectorIteration::Iterator   
  r  
+
CompleteBipartiteGraph (util)   
  l  
-		ReverseArcStaticGraph (util)   
CompleteGraph (util)   
  s  
+
CompleteGraph (util)   ReverseArcListGraph (util)   
ConnectedComponents (operations_research)   LatticeMemoryManager (operations_research)   ReverseArcMixedGraph (util)   
ConnectedComponentsFinder   LinearSumAssignment (operations_research)   ReverseArcStaticGraph (util)   
CostValueCycleHandler (operations_research)   ListGraph (util)   
  s  
ConnectedComponents (operations_research)   LatticeMemoryManager (operations_research)   
ConnectedComponentsFinder   LinearSumAssignment (operations_research)   SccCounterOutput   
ConnectedComponentsTypeHelper (internal)   ListGraph (util)   ConnectedComponentsTypeHelper::SelectContainer (internal)   
CostValueCycleHandler (operations_research)   
  m  
-		ConnectedComponentsTypeHelper::SelectContainer< U, absl::enable_if_t< std::is_integral< decltype(std::declval< const U & >()(std::declval< const T & >()))>::value > > (internal)   
ForwardStaticGraph::CycleHandlerForAnnotatedArcs (operations_research)   Set (operations_research)   
EbertGraphBase::CycleHandlerForAnnotatedArcs (operations_research)   MaxFlow (operations_research)   SetRangeIterator (operations_research)   
ForwardStaticGraph::CycleHandlerForAnnotatedArcs (operations_research)   
  m  
+
EbertGraphBase::CycleHandlerForAnnotatedArcs (operations_research)   SccCounterOutput   
  d  
-		MaxFlowStatusClass (operations_research)   SetRangeWithCardinality (operations_research)   
MinCostFlow (operations_research)   SimpleMaxFlow (operations_research)   
DenseConnectedComponentsFinder   MinCostFlowBase (operations_research)   SimpleMinCostFlow (operations_research)   
MaxFlow (operations_research)   Set (operations_research)   
MaxFlowStatusClass (operations_research)   SetRangeIterator (operations_research)   
DenseConnectedComponentsFinder   MinCostFlow (operations_research)   SetRangeWithCardinality (operations_research)   
  e  
-
  n  
-		StarGraphBase (operations_research)   
StaticGraph (util)   
EbertGraph (operations_research)   StarGraphBase::NodeIterator (operations_research)   SVector (util)   
EbertGraphBase (operations_research)   
  o  
-
  t  
-
ElementIterator (operations_research)   
MinCostFlowBase (operations_research)   SimpleMaxFlow (operations_research)   
  n  
+		SimpleMinCostFlow (operations_research)   
EbertGraph (operations_research)   StarGraphBase (operations_research)   
EbertGraphBase (operations_research)   StarGraphBase::NodeIterator (operations_research)   StaticGraph (util)   
ElementIterator (operations_research)   
  o  
+		SVector (util)   
  f  
-		ReverseArcListGraph::OppositeIncomingArcIterator (util)   TailArrayBuilder (operations_research::or_internal)   
ReverseArcStaticGraph::OppositeIncomingArcIterator (util)   TailArrayBuilder< GraphType, false > (operations_research::or_internal)   
ForwardEbertGraph (operations_research)   ReverseArcMixedGraph::OppositeIncomingArcIterator (util)   TailArrayManager (operations_research)   
ForwardStaticGraph (operations_research)   StarGraphBase::OutgoingArcIterator (operations_research)   TailArrayReleaser (operations_research::or_internal)   
  g  
-		ListGraph::OutgoingArcIterator (util)   TailArrayReleaser< GraphType, false > (operations_research::or_internal)   
ReverseArcStaticGraph::OutgoingArcIterator (util)   
  u  
+
  t  
GenericMaxFlow (operations_research)   ReverseArcListGraph::OutgoingArcIterator (util)   
GenericMinCostFlow (operations_research)   ReverseArcMixedGraph::OutgoingArcIterator (util)   UndirectedAdjacencyListsOfDirectedGraph (util)   
graph_traits (operations_research)   StaticGraph::OutgoingArcIterator (util)   
graph_traits< ForwardEbertGraph< NodeIndexType, ArcIndexType > > (operations_research)   CompleteBipartiteGraph::OutgoingArcIterator (util)   
ReverseArcListGraph::OppositeIncomingArcIterator (util)   
ForwardEbertGraph (operations_research)   ReverseArcStaticGraph::OppositeIncomingArcIterator (util)   TailArrayManager (operations_research)   
ForwardStaticGraph (operations_research)   ReverseArcMixedGraph::OppositeIncomingArcIterator (util)   
  u  
+
  g  
+		StarGraphBase::OutgoingArcIterator (operations_research)   
ListGraph::OutgoingArcIterator (util)   UndirectedAdjacencyListsOfDirectedGraph (util)   
GenericMaxFlow (operations_research)   ReverseArcStaticGraph::OutgoingArcIterator (util)   
GenericMinCostFlow (operations_research)   ReverseArcListGraph::OutgoingArcIterator (util)   
a | b | c | d | e | f | g | h | i | l | m | n | o | p | r | s | t | u
diff --git a/docs/cpp_graph/classoperations__research_1_1AnnotatedGraphBuildManager-members.html b/docs/cpp_graph/classoperations__research_1_1AnnotatedGraphBuildManager-members.html index 8b393a02a3..7e5830a7d1 100644 --- a/docs/cpp_graph/classoperations__research_1_1AnnotatedGraphBuildManager-members.html +++ b/docs/cpp_graph/classoperations__research_1_1AnnotatedGraphBuildManager-members.html @@ -47,10 +47,7 @@

This is the complete list of members for operations_research::AnnotatedGraphBuildManager< GraphType >, including all inherited members.

- - - - +
AddArc(typename GraphType::NodeIndex tail, typename GraphType::NodeIndex head)operations_research::or_internal::GraphBuilderFromArcs< GraphType, graph_traits< GraphType >::is_dynamic >inline
AnnotatedGraphBuildManager(typename GraphType::NodeIndex num_nodes, typename GraphType::ArcIndex num_arcs, bool sort_arcs)operations_research::AnnotatedGraphBuildManager< GraphType >inline
Graph(PermutationCycleHandler< typename GraphType::ArcIndex > *client_cycle_handler)operations_research::or_internal::GraphBuilderFromArcs< GraphType, graph_traits< GraphType >::is_dynamic >inline
GraphBuilderFromArcs(typename GraphType::NodeIndex max_num_nodes, typename GraphType::ArcIndex max_num_arcs, bool sort_arcs)operations_research::or_internal::GraphBuilderFromArcs< GraphType, graph_traits< GraphType >::is_dynamic >inline
AnnotatedGraphBuildManager(typename GraphType::NodeIndex num_nodes, typename GraphType::ArcIndex num_arcs, bool sort_arcs)operations_research::AnnotatedGraphBuildManager< GraphType >inline
@@ -64,7 +64,7 @@ Collaboration diagram for operations_research::AnnotatedGraphBuildManager< Gr
Collaboration graph
- +
[legend]
@@ -72,11 +72,6 @@ Collaboration diagram for operations_research::AnnotatedGraphBuildManager< Gr Public Member Functions - - - - -
 AnnotatedGraphBuildManager (typename GraphType::NodeIndex num_nodes, typename GraphType::ArcIndex num_arcs, bool sort_arcs)
 
GraphType::ArcIndex AddArc (typename GraphType::NodeIndex tail, typename GraphType::NodeIndex head)
 
GraphType * Graph (PermutationCycleHandler< typename GraphType::ArcIndex > *client_cycle_handler)
 Builds the graph from the given arcs. More...
 

Detailed Description

template<typename GraphType>
@@ -129,76 +124,6 @@ template<typename GraphType >

Definition at line 2068 of file ebert_graph.h.

- - -

Member Function Documentation

- -

◆ AddArc()

- -
-
- - - - - -
- - - - - - - - - - - - - - - - - - -
GraphType::ArcIndex operations_research::or_internal::GraphBuilderFromArcs< GraphType, is_dynamic >::AddArc (typename GraphType::NodeIndex tail,
typename GraphType::NodeIndex head 
)
- 		-inlineinherited
-
-

Too many arcs or node index out of bounds!

- -

Definition at line 1972 of file ebert_graph.h.

- -
-
- -

◆ Graph()

- -
-
- - - - - -
- - - - - - - - -
GraphType* operations_research::or_internal::GraphBuilderFromArcs< GraphType, is_dynamic >::Graph (PermutationCycleHandler< typename GraphType::ArcIndex > * client_cycle_handler)
- 		-inlineinherited
-
- -

Builds the graph from the given arcs.

- -

Definition at line 1991 of file ebert_graph.h.

-
The documentation for this class was generated from the following file: