<trid="row_1_"><tdclass="entry"><spanstyle="width:16px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1ArcIndexOrderingByTailNode.html"target="_self">operations_research::ArcIndexOrderingByTailNode< GraphType ></a></td><tdclass="desc">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 </td></tr>
<trid="row_2_"class="even"><tdclass="entry"><spanstyle="width:16px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1StarGraphBase_1_1ArcIterator.html"target="_self">operations_research::StarGraphBase< NodeIndexType, ArcIndexType, DerivedGraph >::ArcIterator</a></td><tdclass="desc">Iterator class for traversing the arcs in the graph </td></tr>
<trid="row_5_"><tdclass="entry"><spanstyle="width:16px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classutil_1_1BaseGraph.html"target="_self">util::BaseGraph< NodeIndexType, ArcIndexType, HasReverseArcs ></a></td><tdclass="desc">Base class of all Graphs implemented here </td></tr>
<trid="row_6_0_"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classutil_1_1CompleteBipartiteGraph.html"target="_self">util::CompleteBipartiteGraph< NodeIndexType, ArcIndexType ></a></td><tdclass="desc"><aclass="el"href="classutil_1_1CompleteBipartiteGraph.html"title="CompleteBipartiteGraph implementation ------------------------------------— Nodes and arcs are implic...">CompleteBipartiteGraph</a> implementation ------------------------------------— Nodes and arcs are implicit and not stored </td></tr>
<trid="row_6_1_"class="even"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classutil_1_1CompleteGraph.html"target="_self">util::CompleteGraph< NodeIndexType, ArcIndexType ></a></td><tdclass="desc"><aclass="el"href="classutil_1_1CompleteGraph.html"title="CompleteGraph implementation ---------------------------------------------— Nodes and arcs are implic...">CompleteGraph</a> implementation ---------------------------------------------— Nodes and arcs are implicit and not stored </td></tr>
<trid="row_6_2_"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classutil_1_1ListGraph.html"target="_self">util::ListGraph< NodeIndexType, ArcIndexType ></a></td><tdclass="desc">Basic graph implementation without reverse arc </td></tr>
<trid="row_6_3_"class="even"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classutil_1_1StaticGraph.html"target="_self">util::StaticGraph< NodeIndexType, ArcIndexType ></a></td><tdclass="desc">Most efficient implementation of a graph without reverse arcs: </td></tr>
<trid="row_7_0_"class="even"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classutil_1_1ReverseArcListGraph.html"target="_self">util::ReverseArcListGraph< NodeIndexType, ArcIndexType ></a></td><tdclass="desc">Extends the <aclass="el"href="classutil_1_1ListGraph.html"title="Basic graph implementation without reverse arc.">ListGraph</a> by also storing the reverse arcs </td></tr>
<trid="row_7_1_"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classutil_1_1ReverseArcMixedGraph.html"target="_self">util::ReverseArcMixedGraph< NodeIndexType, ArcIndexType ></a></td><tdclass="desc">This graph is a mix between the <aclass="el"href="classutil_1_1ReverseArcListGraph.html"title="Extends the ListGraph by also storing the reverse arcs.">ReverseArcListGraph</a> and the <aclass="el"href="classutil_1_1ReverseArcStaticGraph.html"title="StaticGraph with reverse arc.">ReverseArcStaticGraph</a></td></tr>
<trid="row_7_2_"class="even"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classutil_1_1ReverseArcStaticGraph.html"target="_self">util::ReverseArcStaticGraph< NodeIndexType, ArcIndexType ></a></td><tdclass="desc"><aclass="el"href="classutil_1_1StaticGraph.html"title="Most efficient implementation of a graph without reverse arcs:">StaticGraph</a> with reverse arc </td></tr>
<trid="row_11_"class="even"><tdclass="entry"><spanstyle="width:16px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1ConnectedComponents.html"target="_self">operations_research::ConnectedComponents< NodeIndex, ArcIndex ></a></td><tdclass="desc">Template class implementing a Union-Find algorithm with path compression for maintaining the connected components of a graph </td></tr>
<trid="row_13_"class="even"><tdclass="entry"><spanstyle="width:16px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classDenseConnectedComponentsFinder.html"target="_self">DenseConnectedComponentsFinder</a></td><tdclass="desc">NOTE(user): The rest of the functions below should also be in namespace util, but for historical reasons it hasn't been done yet </td></tr>
<trid="row_14_"><tdclass="entry"><spanstyle="width:16px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1ElementIterator.html"target="_self">operations_research::ElementIterator< Set ></a></td><tdclass="desc"></td></tr>
<trid="row_15_"class="even"><tdclass="entry"><spanstyle="width:16px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="structoperations__research_1_1graph__traits.html"target="_self">operations_research::graph_traits< GraphType ></a></td><tdclass="desc">Traits for <aclass="el"href="classoperations__research_1_1EbertGraphBase.html"title="A template for the base class that holds the functionality that exists in common between the EbertGra...">EbertGraphBase</a> types, for use in testing and clients that work with both forward-only and forward/reverse graphs </td></tr>
<trid="row_19_"><tdclass="entry"><spanstyle="width:16px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="structoperations__research_1_1Graphs.html"target="_self">operations_research::Graphs< Graph ></a></td><tdclass="desc">Since StarGraph does not have exactly the same interface as the other graphs, we define a correspondence there </td></tr>
<trid="row_22_"class="even"><tdclass="entry"><spanstyle="width:16px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1EbertGraph_1_1IncomingArcIterator.html"target="_self">operations_research::EbertGraph< NodeIndexType, ArcIndexType >::IncomingArcIterator</a></td><tdclass="desc">Iterator class for traversing the incoming arcs associated to a given node </td></tr>
<trid="row_23_"><tdclass="entry"><spanstyle="width:16px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="structMutableVectorIteration_1_1Iterator.html"target="_self">MutableVectorIteration< T >::Iterator</a></td><tdclass="desc"></td></tr>
<trid="row_24_"class="even"><tdclass="entry"><spanstyle="width:16px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1LatticeMemoryManager.html"target="_self">operations_research::LatticeMemoryManager< Set, CostType ></a></td><tdclass="desc">The Dynamic Programming (DP) algorithm memorizes the values f(set, node) for node in set, for all the subsets of cardinality <= max_card_ </td></tr>
<trid="row_26_"class="even"><tdclass="entry"><spanstyle="width:16px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1LinearSumAssignment.html"target="_self">operations_research::LinearSumAssignment< GraphType ></a></td><tdclass="desc">This class does not take ownership of its underlying graph </td></tr>
<trid="row_27_"><tdclass="entry"><spanstyle="width:0px;display:inline-block;"> </span><spanid="arr_27_"class="arrow"onclick="toggleFolder('27_')">▼</span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1MaxFlowStatusClass.html"target="_self">operations_research::MaxFlowStatusClass</a></td><tdclass="desc">We want an enum for the Status of a max flow run, and we want this enum to be scoped under GenericMaxFlow<></td></tr>
<trid="row_28_"><tdclass="entry"><spanstyle="width:0px;display:inline-block;"> </span><spanid="arr_28_"class="arrow"onclick="toggleFolder('28_')">▼</span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1MinCostFlowBase.html"target="_self">operations_research::MinCostFlowBase</a></td><tdclass="desc">Different statuses for a solved problem </td></tr>
<trid="row_28_2_"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1SimpleMinCostFlow.html"target="_self">operations_research::SimpleMinCostFlow</a></td><tdclass="desc">A simple and efficient min-cost flow interface </td></tr>
<trid="row_29_"class="even"><tdclass="entry"><spanstyle="width:16px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1StarGraphBase_1_1NodeIterator.html"target="_self">operations_research::StarGraphBase< NodeIndexType, ArcIndexType, DerivedGraph >::NodeIterator</a></td><tdclass="desc">Iterator class for traversing all the nodes in the graph </td></tr>
<trid="row_33_"><tdclass="entry"><spanstyle="width:16px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1StarGraphBase_1_1OutgoingArcIterator.html"target="_self">operations_research::StarGraphBase< NodeIndexType, ArcIndexType, DerivedGraph >::OutgoingArcIterator</a></td><tdclass="desc">Iterator class for traversing the outgoing arcs associated to a given node </td></tr>
<trid="row_42_"class="even"><tdclass="entry"><spanstyle="width:16px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1EbertGraph_1_1OutgoingOrOppositeIncomingArcIterator.html"target="_self">operations_research::EbertGraph< NodeIndexType, ArcIndexType >::OutgoingOrOppositeIncomingArcIterator</a></td><tdclass="desc">Iterator class for traversing the arcs incident to a given node in the graph </td></tr>
<trid="row_51_"><tdclass="entry"><spanstyle="width:16px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="structSccCounterOutput.html"target="_self">SccCounterOutput< NodeIndex ></a></td><tdclass="desc">A simple custom output class that just counts the number of SCC </td></tr>
<trid="row_53_"><tdclass="entry"><spanstyle="width:16px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1SetRangeIterator.html"target="_self">operations_research::SetRangeIterator< SetRange ></a></td><tdclass="desc">An iterator for sets of increasing corresponding values that have the same cardinality </td></tr>
<trid="row_54_"class="even"><tdclass="entry"><spanstyle="width:16px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1SetRangeWithCardinality.html"target="_self">operations_research::SetRangeWithCardinality< Set ></a></td><tdclass="desc"></td></tr>
<trid="row_55_"><tdclass="entry"><spanstyle="width:16px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1SimpleMaxFlow.html"target="_self">operations_research::SimpleMaxFlow</a></td><tdclass="desc">A simple and efficient max-cost flow interface </td></tr>
<trid="row_56_0_"><tdclass="entry"><spanstyle="width:16px;display:inline-block;"> </span><spanid="arr_56_0_"class="arrow"onclick="toggleFolder('56_0_')">▼</span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1EbertGraphBase.html"target="_self">operations_research::EbertGraphBase< NodeIndexType, ArcIndexType, DerivedGraph ></a></td><tdclass="desc">A template for the base class that holds the functionality that exists in common between the EbertGraph<> template and the ForwardEbertGraph<> template </td></tr>
<trid="row_58_0_0_"><tdclass="entry"><spanstyle="width:48px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1ForwardEbertGraph.html"target="_self">operations_research::ForwardEbertGraph< NodeIndexType, ArcIndexType ></a></td><tdclass="desc">A forward-star-only graph representation for greater efficiency in those algorithms that don't need reverse arcs </td></tr>
<trid="row_60_"class="even"><tdclass="entry"><spanstyle="width:16px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classutil_1_1SVector.html"target="_self">util::SVector< T ></a></td><tdclass="desc">Forward declaration </td></tr>
<trid="row_64_"class="even"><tdclass="entry"><spanstyle="width:16px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classutil_1_1UndirectedAdjacencyListsOfDirectedGraph.html"target="_self">util::UndirectedAdjacencyListsOfDirectedGraph< Graph ></a></td><tdclass="desc">This can be used to view a directed graph (that supports reverse arcs) from <aclass="el"href="graph_8h.html">graph.h</a> as un undirected graph: operator[](node) returns a pseudo-container that iterates over all nodes adjacent to "node" (from outgoing or incoming arcs) </td></tr>
