<trid="row_0_"class="even"><tdclass="entry"><spanstyle="width:0px;display:inline-block;"> </span><spanid="arr_0_"class="arrow"onclick="toggleFolder('0_')">▼</span><spanclass="icona"><spanclass="icon">N</span></span><aclass="el"href="namespaceoperations__research.html"target="_self">operations_research</a></td><tdclass="desc">Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License </td></tr>
<trid="row_0_2_"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1ArcIndexOrderingByTailNode.html"target="_self">ArcIndexOrderingByTailNode</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_0_3_"class="even"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1BronKerboschAlgorithm.html"target="_self">BronKerboschAlgorithm</a></td><tdclass="desc">Implements the Bron-Kerbosch algorithm for finding maximal cliques </td></tr>
<trid="row_0_5_"class="even"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1ConnectedComponents.html"target="_self">ConnectedComponents</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_0_7_0_"><tdclass="entry"><spanstyle="width:48px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1EbertGraph_1_1IncomingArcIterator.html"target="_self">IncomingArcIterator</a></td><tdclass="desc">Iterator class for traversing the incoming arcs associated to a given node </td></tr>
<trid="row_0_7_1_"class="even"><tdclass="entry"><spanstyle="width:48px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1EbertGraph_1_1OutgoingOrOppositeIncomingArcIterator.html"target="_self">OutgoingOrOppositeIncomingArcIterator</a></td><tdclass="desc">Iterator class for traversing the arcs incident to a given node in the graph </td></tr>
<trid="row_0_8_"><tdclass="entry"><spanstyle="width:16px;display:inline-block;"> </span><spanid="arr_0_8_"class="arrow"onclick="toggleFolder('0_8_')">▼</span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1EbertGraphBase.html"target="_self">EbertGraphBase</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_0_10_"class="even"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1ForwardEbertGraph.html"target="_self">ForwardEbertGraph</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_0_14_"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="structoperations__research_1_1graph__traits.html"target="_self">graph_traits</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_0_17_"class="even"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="structoperations__research_1_1Graphs.html"target="_self">Graphs</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_0_20_"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1LatticeMemoryManager.html"target="_self">LatticeMemoryManager</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_0_21_"class="even"><tdclass="entry"><spanstyle="width:16px;display:inline-block;"> </span><spanid="arr_0_21_"class="arrow"onclick="toggleFolder('0_21_')">▼</span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1LinearSumAssignment.html"target="_self">LinearSumAssignment</a></td><tdclass="desc">This class does not take ownership of its underlying graph </td></tr>
<trid="row_0_22_"class="even"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1MaxFlow.html"target="_self">MaxFlow</a></td><tdclass="desc">Default instance <aclass="el"href="classoperations__research_1_1MaxFlow.html"title="Default instance MaxFlow that uses StarGraph.">MaxFlow</a> that uses StarGraph </td></tr>
<trid="row_0_23_"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1MaxFlowStatusClass.html"target="_self">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_0_24_"class="even"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1MinCostFlow.html"target="_self">MinCostFlow</a></td><tdclass="desc">Default <aclass="el"href="classoperations__research_1_1MinCostFlow.html"title="Default MinCostFlow instance that uses StarGraph.">MinCostFlow</a> instance that uses StarGraph </td></tr>
<trid="row_0_25_"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1MinCostFlowBase.html"target="_self">MinCostFlowBase</a></td><tdclass="desc">Different statuses for a solved problem </td></tr>
<trid="row_0_30_"class="even"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1SetRangeIterator.html"target="_self">SetRangeIterator</a></td><tdclass="desc">An iterator for sets of increasing corresponding values that have the same cardinality </td></tr>
<trid="row_0_34_0_"><tdclass="entry"><spanstyle="width:48px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1StarGraphBase_1_1ArcIterator.html"target="_self">ArcIterator</a></td><tdclass="desc">Iterator class for traversing the arcs in the graph </td></tr>
<trid="row_0_34_1_"class="even"><tdclass="entry"><spanstyle="width:48px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1StarGraphBase_1_1NodeIterator.html"target="_self">NodeIterator</a></td><tdclass="desc">Iterator class for traversing all the nodes in the graph </td></tr>
<trid="row_0_34_2_"><tdclass="entry"><spanstyle="width:48px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classoperations__research_1_1StarGraphBase_1_1OutgoingArcIterator.html"target="_self">OutgoingArcIterator</a></td><tdclass="desc">Iterator class for traversing the outgoing arcs associated to a given node </td></tr>
<trid="row_1_"><tdclass="entry"><spanstyle="width:0px;display:inline-block;"> </span><spanid="arr_1_"class="arrow"onclick="toggleFolder('1_')">▼</span><spanclass="icona"><spanclass="icon">N</span></span><aclass="el"href="namespaceutil.html"target="_self">util</a></td><tdclass="desc">Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License </td></tr>
<trid="row_1_0_"class="even"><tdclass="entry"><spanstyle="width:32px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classutil_1_1BaseGraph.html"target="_self">BaseGraph</a></td><tdclass="desc">Base class of all Graphs implemented here </td></tr>
<trid="row_1_1_"><tdclass="entry"><spanstyle="width:16px;display:inline-block;"> </span><spanid="arr_1_1_"class="arrow"onclick="toggleFolder('1_1_')">▼</span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classutil_1_1CompleteBipartiteGraph.html"target="_self">CompleteBipartiteGraph</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_1_2_"><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">CompleteGraph</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_1_3_"class="even"><tdclass="entry"><spanstyle="width:16px;display:inline-block;"> </span><spanid="arr_1_3_"class="arrow"onclick="toggleFolder('1_3_')">▼</span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classutil_1_1ListGraph.html"target="_self">ListGraph</a></td><tdclass="desc">Basic graph implementation without reverse arc </td></tr>
<trid="row_1_4_"><tdclass="entry"><spanstyle="width:16px;display:inline-block;"> </span><spanid="arr_1_4_"class="arrow"onclick="toggleFolder('1_4_')">▼</span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classutil_1_1ReverseArcListGraph.html"target="_self">ReverseArcListGraph</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_1_5_"><tdclass="entry"><spanstyle="width:16px;display:inline-block;"> </span><spanid="arr_1_5_"class="arrow"onclick="toggleFolder('1_5_')">▼</span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classutil_1_1ReverseArcMixedGraph.html"target="_self">ReverseArcMixedGraph</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_1_6_"class="even"><tdclass="entry"><spanstyle="width:16px;display:inline-block;"> </span><spanid="arr_1_6_"class="arrow"onclick="toggleFolder('1_6_')">▼</span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classutil_1_1ReverseArcStaticGraph.html"target="_self">ReverseArcStaticGraph</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_1_7_"><tdclass="entry"><spanstyle="width:16px;display:inline-block;"> </span><spanid="arr_1_7_"class="arrow"onclick="toggleFolder('1_7_')">▼</span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classutil_1_1StaticGraph.html"target="_self">StaticGraph</a></td><tdclass="desc">Most efficient implementation of a graph without reverse arcs: </td></tr>
<trid="row_1_9_"class="even"><tdclass="entry"><spanstyle="width:16px;display:inline-block;"> </span><spanid="arr_1_9_"class="arrow"onclick="toggleFolder('1_9_')">▼</span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="classutil_1_1UndirectedAdjacencyListsOfDirectedGraph.html"target="_self">UndirectedAdjacencyListsOfDirectedGraph</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>
<trid="row_3_"><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_4_"class="even"><tdclass="entry"><spanstyle="width:16px;display:inline-block;"> </span><spanclass="icona"><spanclass="icon">C</span></span><aclass="el"href="structSccCounterOutput.html"target="_self">SccCounterOutput</a></td><tdclass="desc">A simple custom output class that just counts the number of SCC </td></tr>
