151 lines
40 KiB
HTML
151 lines
40 KiB
HTML
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
|
|
<html xmlns="http://www.w3.org/1999/xhtml">
|
|
<head>
|
|
<title>OR-Tools</title>
|
|
<meta http-equiv="Content-Type" content="text/html;"/>
|
|
<meta charset="utf-8"/>
|
|
<!--<link rel='stylesheet' type='text/css' href="https://fonts.googleapis.com/css?family=Ubuntu:400,700,400italic"/>-->
|
|
<link rel="stylesheet" type="text/css" href="ortools.css" title="default" media="screen,print" />
|
|
<script type="text/javascript" src="jquery.js"></script>
|
|
<script type="text/javascript" src="dynsections.js"></script>
|
|
</head>
|
|
<body>
|
|
<div id="banner-container">
|
|
<div id="banner">
|
|
<span id="sfml">OR-Tools 7.2</span>
|
|
</div>
|
|
</div>
|
|
<link rel="icon" href="https://developers.google.com/optimization/images/orLogo.png">
|
|
<div id="content">
|
|
<!-- Generated by Doxygen 1.8.15 -->
|
|
<div id="navrow1" class="tabs">
|
|
<ul class="tablist">
|
|
<li><a href="index.html"><span>Main Page</span></a></li>
|
|
<li><a href="pages.html"><span>Related Pages</span></a></li>
|
|
<li><a href="namespaces.html"><span>Namespaces</span></a></li>
|
|
<li class="current"><a href="annotated.html"><span>Classes</span></a></li>
|
|
<li><a href="files.html"><span>Files</span></a></li>
|
|
</ul>
|
|
</div>
|
|
<div id="navrow2" class="tabs2">
|
|
<ul class="tablist">
|
|
<li><a href="annotated.html"><span>Class List</span></a></li>
|
|
<li><a href="classes.html"><span>Class Index</span></a></li>
|
|
<li class="current"><a href="inherits.html"><span>Class Hierarchy</span></a></li>
|
|
<li><a href="functions.html"><span>Class Members</span></a></li>
|
|
</ul>
|
|
</div>
|
|
</div><!-- top -->
|
|
<div class="header">
|
|
<div class="headertitle">
|
|
<div class="title">Class Hierarchy</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<div class="textblock">
|
|
<p><a href="inherits.html">Go to the graphical class hierarchy</a></p>
|
|
This inheritance list is sorted roughly, but not completely, alphabetically:</div><div class="directory">
|
|
<div class="levels">[detail level <span onclick="javascript:toggleLevel(1);">1</span><span onclick="javascript:toggleLevel(2);">2</span><span onclick="javascript:toggleLevel(3);">3</span>]</div><table class="directory">
|
|
<tr id="row_0_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1ArcFunctorOrderingByTailAndHead.html" target="_self">operations_research::ArcFunctorOrderingByTailAndHead< GraphType ></a></td><td class="desc"></td></tr>
|
|
<tr id="row_1_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1ArcIndexOrderingByTailNode.html" target="_self">operations_research::ArcIndexOrderingByTailNode< GraphType ></a></td><td class="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>
|
|
<tr id="row_2_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1StarGraphBase_1_1ArcIterator.html" target="_self">operations_research::StarGraphBase< NodeIndexType, ArcIndexType, DerivedGraph >::ArcIterator</a></td><td class="desc">Iterator class for traversing the arcs in the graph </td></tr>
|
|
<tr id="row_3_"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_3_" class="arrow" onclick="toggleFolder('3_')">▼</span><span class="icona"><span class="icon">C</span></span><b>ArcIterator</b></td><td class="desc"></td></tr>
|
|
<tr id="row_3_0_" class="even"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classutil_1_1UndirectedAdjacencyListsOfDirectedGraph_1_1AdjacencyListIterator.html" target="_self">util::UndirectedAdjacencyListsOfDirectedGraph< Graph >::AdjacencyListIterator</a></td><td class="desc"></td></tr>
|
|
<tr id="row_4_"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_4_" class="arrow" onclick="toggleFolder('4_')">▼</span><span class="icona"><span class="icon">C</span></span><b>ArrayIndexCycleHandler</b></td><td class="desc"></td></tr>
|
|
<tr id="row_4_0_" class="even"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1ForwardStaticGraph_1_1CycleHandlerForAnnotatedArcs.html" target="_self">operations_research::ForwardStaticGraph< NodeIndexType, ArcIndexType >::CycleHandlerForAnnotatedArcs</a></td><td class="desc"></td></tr>
|
|
<tr id="row_5_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classutil_1_1BaseGraph.html" target="_self">util::BaseGraph< NodeIndexType, ArcIndexType, HasReverseArcs ></a></td><td class="desc">Base class of all Graphs implemented here </td></tr>
|
|
<tr id="row_6_" class="even"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_6_" class="arrow" onclick="toggleFolder('6_')">▼</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classutil_1_1BaseGraph.html" target="_self">util::BaseGraph< NodeIndexType, ArcIndexType, false ></a></td><td class="desc"></td></tr>
|
|
<tr id="row_6_0_"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classutil_1_1CompleteBipartiteGraph.html" target="_self">util::CompleteBipartiteGraph< NodeIndexType, ArcIndexType ></a></td><td class="desc"><a class="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>
|
|
<tr id="row_6_1_" class="even"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classutil_1_1CompleteGraph.html" target="_self">util::CompleteGraph< NodeIndexType, ArcIndexType ></a></td><td class="desc"><a class="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>
|
|
<tr id="row_6_2_"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classutil_1_1ListGraph.html" target="_self">util::ListGraph< NodeIndexType, ArcIndexType ></a></td><td class="desc">Basic graph implementation without reverse arc </td></tr>
|
|
<tr id="row_6_3_" class="even"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classutil_1_1StaticGraph.html" target="_self">util::StaticGraph< NodeIndexType, ArcIndexType ></a></td><td class="desc">Most efficient implementation of a graph without reverse arcs: </td></tr>
|
|
<tr id="row_7_"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_7_" class="arrow" onclick="toggleFolder('7_')">▼</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classutil_1_1BaseGraph.html" target="_self">util::BaseGraph< NodeIndexType, ArcIndexType, true ></a></td><td class="desc"></td></tr>
|
|
<tr id="row_7_0_" class="even"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classutil_1_1ReverseArcListGraph.html" target="_self">util::ReverseArcListGraph< NodeIndexType, ArcIndexType ></a></td><td class="desc">Extends the <a class="el" href="classutil_1_1ListGraph.html" title="Basic graph implementation without reverse arc.">ListGraph</a> by also storing the reverse arcs </td></tr>
|
|
<tr id="row_7_1_"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classutil_1_1ReverseArcMixedGraph.html" target="_self">util::ReverseArcMixedGraph< NodeIndexType, ArcIndexType ></a></td><td class="desc">This graph is a mix between the <a class="el" href="classutil_1_1ReverseArcListGraph.html" title="Extends the ListGraph by also storing the reverse arcs.">ReverseArcListGraph</a> and the <a class="el" href="classutil_1_1ReverseArcStaticGraph.html" title="StaticGraph with reverse arc.">ReverseArcStaticGraph</a> </td></tr>
|
|
<tr id="row_7_2_" class="even"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classutil_1_1ReverseArcStaticGraph.html" target="_self">util::ReverseArcStaticGraph< NodeIndexType, ArcIndexType ></a></td><td class="desc"><a class="el" href="classutil_1_1StaticGraph.html" title="Most efficient implementation of a graph without reverse arcs:">StaticGraph</a> with reverse arc </td></tr>
|
|
<tr id="row_8_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1LinearSumAssignment_1_1BipartiteLeftNodeIterator.html" target="_self">operations_research::LinearSumAssignment< GraphType >::BipartiteLeftNodeIterator</a></td><td class="desc"></td></tr>
|
|
<tr id="row_9_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1BronKerboschAlgorithm.html" target="_self">operations_research::BronKerboschAlgorithm< NodeIndex ></a></td><td class="desc">Implements the Bron-Kerbosch algorithm for finding maximal cliques </td></tr>
|
|
<tr id="row_10_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1ChristofidesPathSolver.html" target="_self">operations_research::ChristofidesPathSolver< CostType, ArcIndex, NodeIndex, CostFunction ></a></td><td class="desc"></td></tr>
|
|
<tr id="row_11_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1ConnectedComponents.html" target="_self">operations_research::ConnectedComponents< NodeIndex, ArcIndex ></a></td><td class="desc">Template class implementing a Union-Find algorithm with path compression for maintaining the connected components of a graph </td></tr>
|
|
<tr id="row_12_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classConnectedComponentsFinder.html" target="_self">ConnectedComponentsFinder< T, CompareOrHashT ></a></td><td class="desc">Usage: ConnectedComponentsFinder<MyNodeType> cc; cc.AddNode(node1); cc.AddNode(node2); cc.AddEdge(node1, node2); .. </td></tr>
|
|
<tr id="row_13_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classDenseConnectedComponentsFinder.html" target="_self">DenseConnectedComponentsFinder</a></td><td class="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>
|
|
<tr id="row_14_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1ElementIterator.html" target="_self">operations_research::ElementIterator< Set ></a></td><td class="desc"></td></tr>
|
|
<tr id="row_15_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="structoperations__research_1_1graph__traits.html" target="_self">operations_research::graph_traits< GraphType ></a></td><td class="desc">Traits for <a class="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>
|
|
<tr id="row_16_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="structoperations__research_1_1graph__traits_3_01ForwardEbertGraph_3_01NodeIndexType_00_01ArcIndexType_01_4_01_4.html" target="_self">operations_research::graph_traits< ForwardEbertGraph< NodeIndexType, ArcIndexType > ></a></td><td class="desc"></td></tr>
|
|
<tr id="row_17_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="structoperations__research_1_1graph__traits_3_01ForwardStaticGraph_3_01NodeIndexType_00_01ArcIndexType_01_4_01_4.html" target="_self">operations_research::graph_traits< ForwardStaticGraph< NodeIndexType, ArcIndexType > ></a></td><td class="desc"></td></tr>
|
|
<tr id="row_18_"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_18_" class="arrow" onclick="toggleFolder('18_')">▼</span><span class="icona"><span class="icon">C</span></span><b>operations_research::or_internal::GraphBuilderFromArcs< GraphType, graph_traits< GraphType >::is_dynamic ></b></td><td class="desc"></td></tr>
|
|
<tr id="row_18_0_" class="even"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1AnnotatedGraphBuildManager.html" target="_self">operations_research::AnnotatedGraphBuildManager< GraphType ></a></td><td class="desc"></td></tr>
|
|
<tr id="row_19_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="structoperations__research_1_1Graphs.html" target="_self">operations_research::Graphs< Graph ></a></td><td class="desc">Since StarGraph does not have exactly the same interface as the other graphs, we define a correspondence there </td></tr>
|
|
<tr id="row_20_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="structoperations__research_1_1Graphs_3_01operations__research_1_1StarGraph_01_4.html" target="_self">operations_research::Graphs< operations_research::StarGraph ></a></td><td class="desc"></td></tr>
|
|
<tr id="row_21_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1HamiltonianPathSolver.html" target="_self">operations_research::HamiltonianPathSolver< CostType, CostFunction ></a></td><td class="desc"></td></tr>
|
|
<tr id="row_22_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1EbertGraph_1_1IncomingArcIterator.html" target="_self">operations_research::EbertGraph< NodeIndexType, ArcIndexType >::IncomingArcIterator</a></td><td class="desc">Iterator class for traversing the incoming arcs associated to a given node </td></tr>
|
|
<tr id="row_23_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="structMutableVectorIteration_1_1Iterator.html" target="_self">MutableVectorIteration< T >::Iterator</a></td><td class="desc"></td></tr>
|
|
<tr id="row_24_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1LatticeMemoryManager.html" target="_self">operations_research::LatticeMemoryManager< Set, CostType ></a></td><td class="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>
|
|
<tr id="row_25_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1LatticeMemoryManager.html" target="_self">operations_research::LatticeMemoryManager< operations_research::Set, CostType ></a></td><td class="desc"></td></tr>
|
|
<tr id="row_26_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1LinearSumAssignment.html" target="_self">operations_research::LinearSumAssignment< GraphType ></a></td><td class="desc">This class does not take ownership of its underlying graph </td></tr>
|
|
<tr id="row_27_"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_27_" class="arrow" onclick="toggleFolder('27_')">▼</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1MaxFlowStatusClass.html" target="_self">operations_research::MaxFlowStatusClass</a></td><td class="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>
|
|
<tr id="row_27_0_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_27_0_" class="arrow" onclick="toggleFolder('27_0_')">▼</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1GenericMaxFlow.html" target="_self">operations_research::GenericMaxFlow< StarGraph ></a></td><td class="desc"></td></tr>
|
|
<tr id="row_27_0_0_"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1MaxFlow.html" target="_self">operations_research::MaxFlow</a></td><td class="desc">Default instance <a class="el" href="classoperations__research_1_1MaxFlow.html" title="Default instance MaxFlow that uses StarGraph.">MaxFlow</a> that uses StarGraph </td></tr>
|
|
<tr id="row_27_1_" class="even"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1GenericMaxFlow.html" target="_self">operations_research::GenericMaxFlow< Graph ></a></td><td class="desc">Forward declaration </td></tr>
|
|
<tr id="row_28_"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_28_" class="arrow" onclick="toggleFolder('28_')">▼</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1MinCostFlowBase.html" target="_self">operations_research::MinCostFlowBase</a></td><td class="desc">Different statuses for a solved problem </td></tr>
|
|
<tr id="row_28_0_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_28_0_" class="arrow" onclick="toggleFolder('28_0_')">▼</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1GenericMinCostFlow.html" target="_self">operations_research::GenericMinCostFlow< StarGraph ></a></td><td class="desc"></td></tr>
|
|
<tr id="row_28_0_0_"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1MinCostFlow.html" target="_self">operations_research::MinCostFlow</a></td><td class="desc">Default <a class="el" href="classoperations__research_1_1MinCostFlow.html" title="Default MinCostFlow instance that uses StarGraph.">MinCostFlow</a> instance that uses StarGraph </td></tr>
|
|
<tr id="row_28_1_" class="even"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1GenericMinCostFlow.html" target="_self">operations_research::GenericMinCostFlow< Graph, ArcFlowType, ArcScaledCostType ></a></td><td class="desc">Forward declaration </td></tr>
|
|
<tr id="row_28_2_"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1SimpleMinCostFlow.html" target="_self">operations_research::SimpleMinCostFlow</a></td><td class="desc">A simple and efficient min-cost flow interface </td></tr>
|
|
<tr id="row_29_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1StarGraphBase_1_1NodeIterator.html" target="_self">operations_research::StarGraphBase< NodeIndexType, ArcIndexType, DerivedGraph >::NodeIterator</a></td><td class="desc">Iterator class for traversing all the nodes in the graph </td></tr>
|
|
<tr id="row_30_"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_30_" class="arrow" onclick="toggleFolder('30_')">▼</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classutil_1_1ReverseArcListGraph_1_1OppositeIncomingArcIterator.html" target="_self">util::ReverseArcListGraph< NodeIndexType, ArcIndexType >::OppositeIncomingArcIterator</a></td><td class="desc"></td></tr>
|
|
<tr id="row_30_0_" class="even"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classutil_1_1ReverseArcListGraph_1_1IncomingArcIterator.html" target="_self">util::ReverseArcListGraph< NodeIndexType, ArcIndexType >::IncomingArcIterator</a></td><td class="desc"></td></tr>
|
|
<tr id="row_31_"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_31_" class="arrow" onclick="toggleFolder('31_')">▼</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classutil_1_1ReverseArcStaticGraph_1_1OppositeIncomingArcIterator.html" target="_self">util::ReverseArcStaticGraph< NodeIndexType, ArcIndexType >::OppositeIncomingArcIterator</a></td><td class="desc"></td></tr>
|
|
<tr id="row_31_0_" class="even"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classutil_1_1ReverseArcStaticGraph_1_1IncomingArcIterator.html" target="_self">util::ReverseArcStaticGraph< NodeIndexType, ArcIndexType >::IncomingArcIterator</a></td><td class="desc"></td></tr>
|
|
<tr id="row_32_"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_32_" class="arrow" onclick="toggleFolder('32_')">▼</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classutil_1_1ReverseArcMixedGraph_1_1OppositeIncomingArcIterator.html" target="_self">util::ReverseArcMixedGraph< NodeIndexType, ArcIndexType >::OppositeIncomingArcIterator</a></td><td class="desc"></td></tr>
|
|
<tr id="row_32_0_" class="even"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classutil_1_1ReverseArcMixedGraph_1_1IncomingArcIterator.html" target="_self">util::ReverseArcMixedGraph< NodeIndexType, ArcIndexType >::IncomingArcIterator</a></td><td class="desc"></td></tr>
|
|
<tr id="row_33_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1StarGraphBase_1_1OutgoingArcIterator.html" target="_self">operations_research::StarGraphBase< NodeIndexType, ArcIndexType, DerivedGraph >::OutgoingArcIterator</a></td><td class="desc">Iterator class for traversing the outgoing arcs associated to a given node </td></tr>
|
|
<tr id="row_34_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classutil_1_1ListGraph_1_1OutgoingArcIterator.html" target="_self">util::ListGraph< NodeIndexType, ArcIndexType >::OutgoingArcIterator</a></td><td class="desc"></td></tr>
|
|
<tr id="row_35_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classutil_1_1ReverseArcStaticGraph_1_1OutgoingArcIterator.html" target="_self">util::ReverseArcStaticGraph< NodeIndexType, ArcIndexType >::OutgoingArcIterator</a></td><td class="desc"></td></tr>
|
|
<tr id="row_36_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classutil_1_1ReverseArcListGraph_1_1OutgoingArcIterator.html" target="_self">util::ReverseArcListGraph< NodeIndexType, ArcIndexType >::OutgoingArcIterator</a></td><td class="desc"></td></tr>
|
|
<tr id="row_37_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classutil_1_1ReverseArcMixedGraph_1_1OutgoingArcIterator.html" target="_self">util::ReverseArcMixedGraph< NodeIndexType, ArcIndexType >::OutgoingArcIterator</a></td><td class="desc"></td></tr>
|
|
<tr id="row_38_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classutil_1_1StaticGraph_1_1OutgoingArcIterator.html" target="_self">util::StaticGraph< NodeIndexType, ArcIndexType >::OutgoingArcIterator</a></td><td class="desc"></td></tr>
|
|
<tr id="row_39_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classutil_1_1CompleteBipartiteGraph_1_1OutgoingArcIterator.html" target="_self">util::CompleteBipartiteGraph< NodeIndexType, ArcIndexType >::OutgoingArcIterator</a></td><td class="desc"></td></tr>
|
|
<tr id="row_40_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classutil_1_1ListGraph_1_1OutgoingHeadIterator.html" target="_self">util::ListGraph< NodeIndexType, ArcIndexType >::OutgoingHeadIterator</a></td><td class="desc"></td></tr>
|
|
<tr id="row_41_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classutil_1_1ReverseArcListGraph_1_1OutgoingHeadIterator.html" target="_self">util::ReverseArcListGraph< NodeIndexType, ArcIndexType >::OutgoingHeadIterator</a></td><td class="desc"></td></tr>
|
|
<tr id="row_42_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1EbertGraph_1_1OutgoingOrOppositeIncomingArcIterator.html" target="_self">operations_research::EbertGraph< NodeIndexType, ArcIndexType >::OutgoingOrOppositeIncomingArcIterator</a></td><td class="desc">Iterator class for traversing the arcs incident to a given node in the graph </td></tr>
|
|
<tr id="row_43_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classutil_1_1ReverseArcMixedGraph_1_1OutgoingOrOppositeIncomingArcIterator.html" target="_self">util::ReverseArcMixedGraph< NodeIndexType, ArcIndexType >::OutgoingOrOppositeIncomingArcIterator</a></td><td class="desc"></td></tr>
|
|
<tr id="row_44_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classutil_1_1ReverseArcStaticGraph_1_1OutgoingOrOppositeIncomingArcIterator.html" target="_self">util::ReverseArcStaticGraph< NodeIndexType, ArcIndexType >::OutgoingOrOppositeIncomingArcIterator</a></td><td class="desc"></td></tr>
|
|
<tr id="row_45_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classutil_1_1ReverseArcListGraph_1_1OutgoingOrOppositeIncomingArcIterator.html" target="_self">util::ReverseArcListGraph< NodeIndexType, ArcIndexType >::OutgoingOrOppositeIncomingArcIterator</a></td><td class="desc"></td></tr>
|
|
<tr id="row_46_" class="even"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_46_" class="arrow" onclick="toggleFolder('46_')">▼</span><span class="icona"><span class="icon">C</span></span><b>PermutationCycleHandler</b></td><td class="desc"></td></tr>
|
|
<tr id="row_46_0_"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1CostValueCycleHandler.html" target="_self">operations_research::CostValueCycleHandler< ArcIndexType ></a></td><td class="desc"></td></tr>
|
|
<tr id="row_46_1_" class="even"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1EbertGraphBase_1_1CycleHandlerForAnnotatedArcs.html" target="_self">operations_research::EbertGraphBase< NodeIndexType, ArcIndexType, DerivedGraph >::CycleHandlerForAnnotatedArcs</a></td><td class="desc"></td></tr>
|
|
<tr id="row_47_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1PermutationIndexComparisonByArcHead.html" target="_self">operations_research::PermutationIndexComparisonByArcHead< NodeIndexType, ArcIndexType ></a></td><td class="desc"></td></tr>
|
|
<tr id="row_48_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1PriorityQueueWithRestrictedPush.html" target="_self">operations_research::PriorityQueueWithRestrictedPush< Element, IntegerPriority ></a></td><td class="desc">Specific but efficient priority queue implementation </td></tr>
|
|
<tr id="row_49_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1PriorityQueueWithRestrictedPush.html" target="_self">operations_research::PriorityQueueWithRestrictedPush< NodeIndex, NodeHeight ></a></td><td class="desc"></td></tr>
|
|
<tr id="row_50_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1PruningHamiltonianSolver.html" target="_self">operations_research::PruningHamiltonianSolver< CostType, CostFunction ></a></td><td class="desc"></td></tr>
|
|
<tr id="row_51_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="structSccCounterOutput.html" target="_self">SccCounterOutput< NodeIndex ></a></td><td class="desc">A simple custom output class that just counts the number of SCC </td></tr>
|
|
<tr id="row_52_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1Set.html" target="_self">operations_research::Set< Integer ></a></td><td class="desc"></td></tr>
|
|
<tr id="row_53_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1SetRangeIterator.html" target="_self">operations_research::SetRangeIterator< SetRange ></a></td><td class="desc">An iterator for sets of increasing corresponding values that have the same cardinality </td></tr>
|
|
<tr id="row_54_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1SetRangeWithCardinality.html" target="_self">operations_research::SetRangeWithCardinality< Set ></a></td><td class="desc"></td></tr>
|
|
<tr id="row_55_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1SimpleMaxFlow.html" target="_self">operations_research::SimpleMaxFlow</a></td><td class="desc">A simple and efficient max-cost flow interface </td></tr>
|
|
<tr id="row_56_" class="even"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_56_" class="arrow" onclick="toggleFolder('56_')">▼</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1StarGraphBase.html" target="_self">operations_research::StarGraphBase< NodeIndexType, ArcIndexType, DerivedGraph ></a></td><td class="desc"></td></tr>
|
|
<tr id="row_56_0_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_56_0_" class="arrow" onclick="toggleFolder('56_0_')">▼</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1EbertGraphBase.html" target="_self">operations_research::EbertGraphBase< NodeIndexType, ArcIndexType, DerivedGraph ></a></td><td class="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>
|
|
<tr id="row_56_0_0_" class="even"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1EbertGraph.html" target="_self">operations_research::EbertGraph< NodeIndexType, ArcIndexType ></a></td><td class="desc">Forward declarations </td></tr>
|
|
<tr id="row_57_"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_57_" class="arrow" onclick="toggleFolder('57_')">▼</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1StarGraphBase.html" target="_self">operations_research::StarGraphBase< NodeIndexType, ArcIndexType, EbertGraph< NodeIndexType, ArcIndexType > ></a></td><td class="desc"></td></tr>
|
|
<tr id="row_57_0_" class="even"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1EbertGraphBase.html" target="_self">operations_research::EbertGraphBase< NodeIndexType, ArcIndexType, EbertGraph< NodeIndexType, ArcIndexType > ></a></td><td class="desc"></td></tr>
|
|
<tr id="row_58_"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_58_" class="arrow" onclick="toggleFolder('58_')">▼</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1StarGraphBase.html" target="_self">operations_research::StarGraphBase< NodeIndexType, ArcIndexType, ForwardEbertGraph< NodeIndexType, ArcIndexType > ></a></td><td class="desc"></td></tr>
|
|
<tr id="row_58_0_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_58_0_" class="arrow" onclick="toggleFolder('58_0_')">▼</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1EbertGraphBase.html" target="_self">operations_research::EbertGraphBase< NodeIndexType, ArcIndexType, ForwardEbertGraph< NodeIndexType, ArcIndexType > ></a></td><td class="desc"></td></tr>
|
|
<tr id="row_58_0_0_"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1ForwardEbertGraph.html" target="_self">operations_research::ForwardEbertGraph< NodeIndexType, ArcIndexType ></a></td><td class="desc">A forward-star-only graph representation for greater efficiency in those algorithms that don't need reverse arcs </td></tr>
|
|
<tr id="row_59_" class="even"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_59_" class="arrow" onclick="toggleFolder('59_')">▼</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1StarGraphBase.html" target="_self">operations_research::StarGraphBase< NodeIndexType, ArcIndexType, ForwardStaticGraph< NodeIndexType, ArcIndexType > ></a></td><td class="desc"></td></tr>
|
|
<tr id="row_59_0_"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1ForwardStaticGraph.html" target="_self">operations_research::ForwardStaticGraph< NodeIndexType, ArcIndexType ></a></td><td class="desc"></td></tr>
|
|
<tr id="row_60_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classutil_1_1SVector.html" target="_self">util::SVector< T ></a></td><td class="desc">Forward declaration </td></tr>
|
|
<tr id="row_61_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classutil_1_1SVector.html" target="_self">util::SVector< ArcIndexType ></a></td><td class="desc"></td></tr>
|
|
<tr id="row_62_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classutil_1_1SVector.html" target="_self">util::SVector< NodeIndexType ></a></td><td class="desc"></td></tr>
|
|
<tr id="row_63_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1TailArrayManager.html" target="_self">operations_research::TailArrayManager< GraphType ></a></td><td class="desc"></td></tr>
|
|
<tr id="row_64_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classutil_1_1UndirectedAdjacencyListsOfDirectedGraph.html" target="_self">util::UndirectedAdjacencyListsOfDirectedGraph< Graph ></a></td><td class="desc">This can be used to view a directed graph (that supports reverse arcs) from <a class="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>
|
|
</table>
|
|
</div><!-- directory -->
|
|
</div><!-- contents -->
|
|
</div>
|
|
<div id="footer-container">
|
|
<div id="footer">
|
|
</div>
|
|
</div>
|
|
</body>
|
|
</html>
|