141 lines
32 KiB
HTML
141 lines
32 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>
|
|
</ul>
|
|
</div>
|
|
</div><!-- top -->
|
|
<div id="side-nav" class="ui-resizable side-nav-resizable">
|
|
<div id="nav-tree">
|
|
<div id="nav-tree-contents">
|
|
<div id="nav-sync" class="sync"></div>
|
|
</div>
|
|
</div>
|
|
<div id="splitbar" style="-moz-user-select:none;"
|
|
class="ui-resizable-handle">
|
|
</div>
|
|
</div>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(document).ready(function(){initNavTree('annotated.html','');});
|
|
/* @license-end */
|
|
</script>
|
|
<div id="doc-content">
|
|
<div class="header">
|
|
<div class="headertitle">
|
|
<div class="title">Class List</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<div class="textblock">Here are the classes, structs, unions and interfaces with brief descriptions:</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:0px;display:inline-block;"> </span><span id="arr_0_" class="arrow" onclick="toggleFolder('0_')">▼</span><span class="icona"><span class="icon">N</span></span><a class="el" href="namespaceoperations__research.html" target="_self">operations_research</a></td><td class="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>
|
|
<tr id="row_0_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_1AnnotatedGraphBuildManager.html" target="_self">AnnotatedGraphBuildManager</a></td><td class="desc"></td></tr>
|
|
<tr id="row_0_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_1ArcFunctorOrderingByTailAndHead.html" target="_self">ArcFunctorOrderingByTailAndHead</a></td><td class="desc"></td></tr>
|
|
<tr id="row_0_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_1ArcIndexOrderingByTailNode.html" target="_self">ArcIndexOrderingByTailNode</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_0_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="classoperations__research_1_1BronKerboschAlgorithm.html" target="_self">BronKerboschAlgorithm</a></td><td class="desc">Implements the Bron-Kerbosch algorithm for finding maximal cliques </td></tr>
|
|
<tr id="row_0_4_"><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_1ChristofidesPathSolver.html" target="_self">ChristofidesPathSolver</a></td><td class="desc"></td></tr>
|
|
<tr id="row_0_5_" 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_1ConnectedComponents.html" target="_self">ConnectedComponents</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_0_6_"><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">CostValueCycleHandler</a></td><td class="desc"></td></tr>
|
|
<tr id="row_0_7_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_0_7_" class="arrow" onclick="toggleFolder('0_7_')">▼</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1EbertGraph.html" target="_self">EbertGraph</a></td><td class="desc">Forward declarations </td></tr>
|
|
<tr id="row_0_7_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_1EbertGraph_1_1IncomingArcIterator.html" target="_self">IncomingArcIterator</a></td><td class="desc">Iterator class for traversing the incoming arcs associated to a given node </td></tr>
|
|
<tr id="row_0_7_1_" 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_1_1OutgoingOrOppositeIncomingArcIterator.html" target="_self">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_0_8_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_0_8_" class="arrow" onclick="toggleFolder('0_8_')">▼</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1EbertGraphBase.html" target="_self">EbertGraphBase</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_0_8_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_1EbertGraphBase_1_1CycleHandlerForAnnotatedArcs.html" target="_self">CycleHandlerForAnnotatedArcs</a></td><td class="desc"></td></tr>
|
|
<tr id="row_0_9_"><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_1ElementIterator.html" target="_self">ElementIterator</a></td><td class="desc"></td></tr>
|
|
<tr id="row_0_10_" 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_1ForwardEbertGraph.html" target="_self">ForwardEbertGraph</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_0_11_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_0_11_" class="arrow" onclick="toggleFolder('0_11_')">▼</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1ForwardStaticGraph.html" target="_self">ForwardStaticGraph</a></td><td class="desc"></td></tr>
|
|
<tr id="row_0_11_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_1ForwardStaticGraph_1_1CycleHandlerForAnnotatedArcs.html" target="_self">CycleHandlerForAnnotatedArcs</a></td><td class="desc"></td></tr>
|
|
<tr id="row_0_12_"><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">GenericMaxFlow</a></td><td class="desc">Forward declaration </td></tr>
|
|
<tr id="row_0_13_" 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">GenericMinCostFlow</a></td><td class="desc">Forward declaration </td></tr>
|
|
<tr id="row_0_14_"><td class="entry"><span style="width:32px;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">graph_traits</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_0_15_" 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="structoperations__research_1_1graph__traits_3_01ForwardEbertGraph_3_01NodeIndexType_00_01ArcIndexType_01_4_01_4.html" target="_self">graph_traits< ForwardEbertGraph< NodeIndexType, ArcIndexType > ></a></td><td class="desc"></td></tr>
|
|
<tr id="row_0_16_"><td class="entry"><span style="width:32px;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">graph_traits< ForwardStaticGraph< NodeIndexType, ArcIndexType > ></a></td><td class="desc"></td></tr>
|
|
<tr id="row_0_17_" 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="structoperations__research_1_1Graphs.html" target="_self">Graphs</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_0_18_"><td class="entry"><span style="width:32px;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">Graphs< operations_research::StarGraph ></a></td><td class="desc"></td></tr>
|
|
<tr id="row_0_19_" 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_1HamiltonianPathSolver.html" target="_self">HamiltonianPathSolver</a></td><td class="desc"></td></tr>
|
|
<tr id="row_0_20_"><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_1LatticeMemoryManager.html" target="_self">LatticeMemoryManager</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_0_21_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_0_21_" class="arrow" onclick="toggleFolder('0_21_')">▼</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1LinearSumAssignment.html" target="_self">LinearSumAssignment</a></td><td class="desc">This class does not take ownership of its underlying graph </td></tr>
|
|
<tr id="row_0_21_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_1LinearSumAssignment_1_1BipartiteLeftNodeIterator.html" target="_self">BipartiteLeftNodeIterator</a></td><td class="desc"></td></tr>
|
|
<tr id="row_0_22_" 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_1MaxFlow.html" target="_self">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_0_23_"><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_1MaxFlowStatusClass.html" target="_self">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_0_24_" 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_1MinCostFlow.html" target="_self">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_0_25_"><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_1MinCostFlowBase.html" target="_self">MinCostFlowBase</a></td><td class="desc">Different statuses for a solved problem </td></tr>
|
|
<tr id="row_0_26_" 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_1PermutationIndexComparisonByArcHead.html" target="_self">PermutationIndexComparisonByArcHead</a></td><td class="desc"></td></tr>
|
|
<tr id="row_0_27_"><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_1PriorityQueueWithRestrictedPush.html" target="_self">PriorityQueueWithRestrictedPush</a></td><td class="desc">Specific but efficient priority queue implementation </td></tr>
|
|
<tr id="row_0_28_" 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_1PruningHamiltonianSolver.html" target="_self">PruningHamiltonianSolver</a></td><td class="desc"></td></tr>
|
|
<tr id="row_0_29_"><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_1Set.html" target="_self">Set</a></td><td class="desc"></td></tr>
|
|
<tr id="row_0_30_" 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_1SetRangeIterator.html" target="_self">SetRangeIterator</a></td><td class="desc">An iterator for sets of increasing corresponding values that have the same cardinality </td></tr>
|
|
<tr id="row_0_31_"><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_1SetRangeWithCardinality.html" target="_self">SetRangeWithCardinality</a></td><td class="desc"></td></tr>
|
|
<tr id="row_0_32_" 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_1SimpleMaxFlow.html" target="_self">SimpleMaxFlow</a></td><td class="desc">A simple and efficient max-cost flow interface </td></tr>
|
|
<tr id="row_0_33_"><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">SimpleMinCostFlow</a></td><td class="desc">A simple and efficient min-cost flow interface </td></tr>
|
|
<tr id="row_0_34_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_0_34_" class="arrow" onclick="toggleFolder('0_34_')">▼</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1StarGraphBase.html" target="_self">StarGraphBase</a></td><td class="desc"></td></tr>
|
|
<tr id="row_0_34_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_1StarGraphBase_1_1ArcIterator.html" target="_self">ArcIterator</a></td><td class="desc">Iterator class for traversing the arcs in the graph </td></tr>
|
|
<tr id="row_0_34_1_" 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_1StarGraphBase_1_1NodeIterator.html" target="_self">NodeIterator</a></td><td class="desc">Iterator class for traversing all the nodes in the graph </td></tr>
|
|
<tr id="row_0_34_2_"><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_1StarGraphBase_1_1OutgoingArcIterator.html" target="_self">OutgoingArcIterator</a></td><td class="desc">Iterator class for traversing the outgoing arcs associated to a given node </td></tr>
|
|
<tr id="row_0_35_" 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_1TailArrayManager.html" target="_self">TailArrayManager</a></td><td class="desc"></td></tr>
|
|
<tr id="row_1_"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_1_" class="arrow" onclick="toggleFolder('1_')">▼</span><span class="icona"><span class="icon">N</span></span><a class="el" href="namespaceutil.html" target="_self">util</a></td><td class="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>
|
|
<tr id="row_1_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_1BaseGraph.html" target="_self">BaseGraph</a></td><td class="desc">Base class of all Graphs implemented here </td></tr>
|
|
<tr id="row_1_1_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_1_1_" class="arrow" onclick="toggleFolder('1_1_')">▼</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classutil_1_1CompleteBipartiteGraph.html" target="_self">CompleteBipartiteGraph</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_1_1_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="classutil_1_1CompleteBipartiteGraph_1_1OutgoingArcIterator.html" target="_self">OutgoingArcIterator</a></td><td class="desc"></td></tr>
|
|
<tr id="row_1_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_1CompleteGraph.html" target="_self">CompleteGraph</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_1_3_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_1_3_" class="arrow" onclick="toggleFolder('1_3_')">▼</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classutil_1_1ListGraph.html" target="_self">ListGraph</a></td><td class="desc">Basic graph implementation without reverse arc </td></tr>
|
|
<tr id="row_1_3_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="classutil_1_1ListGraph_1_1OutgoingArcIterator.html" target="_self">OutgoingArcIterator</a></td><td class="desc"></td></tr>
|
|
<tr id="row_1_3_1_" 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="classutil_1_1ListGraph_1_1OutgoingHeadIterator.html" target="_self">OutgoingHeadIterator</a></td><td class="desc"></td></tr>
|
|
<tr id="row_1_4_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_1_4_" class="arrow" onclick="toggleFolder('1_4_')">▼</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classutil_1_1ReverseArcListGraph.html" target="_self">ReverseArcListGraph</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_1_4_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="classutil_1_1ReverseArcListGraph_1_1IncomingArcIterator.html" target="_self">IncomingArcIterator</a></td><td class="desc"></td></tr>
|
|
<tr id="row_1_4_1_"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classutil_1_1ReverseArcListGraph_1_1OppositeIncomingArcIterator.html" target="_self">OppositeIncomingArcIterator</a></td><td class="desc"></td></tr>
|
|
<tr id="row_1_4_2_" 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="classutil_1_1ReverseArcListGraph_1_1OutgoingArcIterator.html" target="_self">OutgoingArcIterator</a></td><td class="desc"></td></tr>
|
|
<tr id="row_1_4_3_"><td class="entry"><span style="width:48px;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">OutgoingHeadIterator</a></td><td class="desc"></td></tr>
|
|
<tr id="row_1_4_4_" 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="classutil_1_1ReverseArcListGraph_1_1OutgoingOrOppositeIncomingArcIterator.html" target="_self">OutgoingOrOppositeIncomingArcIterator</a></td><td class="desc"></td></tr>
|
|
<tr id="row_1_5_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_1_5_" class="arrow" onclick="toggleFolder('1_5_')">▼</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classutil_1_1ReverseArcMixedGraph.html" target="_self">ReverseArcMixedGraph</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_1_5_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="classutil_1_1ReverseArcMixedGraph_1_1IncomingArcIterator.html" target="_self">IncomingArcIterator</a></td><td class="desc"></td></tr>
|
|
<tr id="row_1_5_1_"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classutil_1_1ReverseArcMixedGraph_1_1OppositeIncomingArcIterator.html" target="_self">OppositeIncomingArcIterator</a></td><td class="desc"></td></tr>
|
|
<tr id="row_1_5_2_" 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="classutil_1_1ReverseArcMixedGraph_1_1OutgoingArcIterator.html" target="_self">OutgoingArcIterator</a></td><td class="desc"></td></tr>
|
|
<tr id="row_1_5_3_"><td class="entry"><span style="width:48px;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">OutgoingOrOppositeIncomingArcIterator</a></td><td class="desc"></td></tr>
|
|
<tr id="row_1_6_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_1_6_" class="arrow" onclick="toggleFolder('1_6_')">▼</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classutil_1_1ReverseArcStaticGraph.html" target="_self">ReverseArcStaticGraph</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_1_6_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="classutil_1_1ReverseArcStaticGraph_1_1IncomingArcIterator.html" target="_self">IncomingArcIterator</a></td><td class="desc"></td></tr>
|
|
<tr id="row_1_6_1_" 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="classutil_1_1ReverseArcStaticGraph_1_1OppositeIncomingArcIterator.html" target="_self">OppositeIncomingArcIterator</a></td><td class="desc"></td></tr>
|
|
<tr id="row_1_6_2_"><td class="entry"><span style="width:48px;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">OutgoingArcIterator</a></td><td class="desc"></td></tr>
|
|
<tr id="row_1_6_3_" 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="classutil_1_1ReverseArcStaticGraph_1_1OutgoingOrOppositeIncomingArcIterator.html" target="_self">OutgoingOrOppositeIncomingArcIterator</a></td><td class="desc"></td></tr>
|
|
<tr id="row_1_7_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_1_7_" class="arrow" onclick="toggleFolder('1_7_')">▼</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classutil_1_1StaticGraph.html" target="_self">StaticGraph</a></td><td class="desc">Most efficient implementation of a graph without reverse arcs: </td></tr>
|
|
<tr id="row_1_7_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="classutil_1_1StaticGraph_1_1OutgoingArcIterator.html" target="_self">OutgoingArcIterator</a></td><td class="desc"></td></tr>
|
|
<tr id="row_1_8_"><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_1SVector.html" target="_self">SVector</a></td><td class="desc">Forward declaration </td></tr>
|
|
<tr id="row_1_9_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_1_9_" class="arrow" onclick="toggleFolder('1_9_')">▼</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classutil_1_1UndirectedAdjacencyListsOfDirectedGraph.html" target="_self">UndirectedAdjacencyListsOfDirectedGraph</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>
|
|
<tr id="row_1_9_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="classutil_1_1UndirectedAdjacencyListsOfDirectedGraph_1_1AdjacencyListIterator.html" target="_self">AdjacencyListIterator</a></td><td class="desc"></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="classConnectedComponentsFinder.html" target="_self">ConnectedComponentsFinder</a></td><td class="desc">Usage: ConnectedComponentsFinder<MyNodeType> cc; cc.AddNode(node1); cc.AddNode(node2); cc.AddEdge(node1, node2); .. </td></tr>
|
|
<tr id="row_3_"><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_4_" 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="structSccCounterOutput.html" target="_self">SccCounterOutput</a></td><td class="desc">A simple custom output class that just counts the number of SCC </td></tr>
|
|
</table>
|
|
</div><!-- directory -->
|
|
</div><!-- contents -->
|
|
</div><!-- doc-content -->
|
|
</div>
|
|
<div id="footer-container">
|
|
<div id="footer">
|
|
</div>
|
|
</div>
|
|
</body>
|
|
</html>
|