Skip to content

Commit 2963d19

Browse files
author
buildbot121
committed
API documentation update by build server
1 parent 4294221 commit 2963d19

12 files changed

+300
-60
lines changed

‎docs/api/Advanced.Algorithms.DataStructures.Graph.AdjacencyList.DiGraphVertex-1.html‎

Lines changed: 42 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -278,6 +278,48 @@ <h3 id="methods">Methods
278278
</h3>
279279

280280

281+
<a id="Advanced_Algorithms_DataStructures_Graph_AdjacencyList_DiGraphVertex_1_GetEdge_" data-uid="Advanced.Algorithms.DataStructures.Graph.AdjacencyList.DiGraphVertex`1.GetEdge*"></a>
282+
<h4 id="Advanced_Algorithms_DataStructures_Graph_AdjacencyList_DiGraphVertex_1_GetEdge_IGraphVertex__0__" data-uid="Advanced.Algorithms.DataStructures.Graph.AdjacencyList.DiGraphVertex`1.GetEdge(IGraphVertex{`0})">GetEdge(IGraphVertex&lt;T&gt;)</h4>
283+
<div class="markdown level1 summary"></div>
284+
<div class="markdown level1 conceptual"></div>
285+
<h5 class="decalaration">Declaration</h5>
286+
<div class="codewrapper">
287+
<pre><code class="lang-csharp hljs">public IEdge&lt;T&gt; GetEdge(IGraphVertex&lt;T&gt; targetVertex)</code></pre>
288+
</div>
289+
<h5 class="parameters">Parameters</h5>
290+
<table class="table table-bordered table-striped table-condensed">
291+
<thead>
292+
<tr>
293+
<th>Type</th>
294+
<th>Name</th>
295+
<th>Description</th>
296+
</tr>
297+
</thead>
298+
<tbody>
299+
<tr>
300+
<td><span class="xref">IGraphVertex</span>&lt;T&gt;</td>
301+
<td><span class="parametername">targetVertex</span></td>
302+
<td></td>
303+
</tr>
304+
</tbody>
305+
</table>
306+
<h5 class="returns">Returns</h5>
307+
<table class="table table-bordered table-striped table-condensed">
308+
<thead>
309+
<tr>
310+
<th>Type</th>
311+
<th>Description</th>
312+
</tr>
313+
</thead>
314+
<tbody>
315+
<tr>
316+
<td><span class="xref">IEdge</span>&lt;T&gt;</td>
317+
<td></td>
318+
</tr>
319+
</tbody>
320+
</table>
321+
322+
281323
<a id="Advanced_Algorithms_DataStructures_Graph_AdjacencyList_DiGraphVertex_1_GetEnumerator_" data-uid="Advanced.Algorithms.DataStructures.Graph.AdjacencyList.DiGraphVertex`1.GetEnumerator*"></a>
282324
<h4 id="Advanced_Algorithms_DataStructures_Graph_AdjacencyList_DiGraphVertex_1_GetEnumerator" data-uid="Advanced.Algorithms.DataStructures.Graph.AdjacencyList.DiGraphVertex`1.GetEnumerator">GetEnumerator()</h4>
283325
<div class="markdown level1 summary"></div>

‎docs/api/Advanced.Algorithms.DataStructures.Graph.AdjacencyList.GraphVertex-1.html‎

Lines changed: 42 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -202,6 +202,48 @@ <h3 id="methods">Methods
202202
</h3>
203203

204204

205+
<a id="Advanced_Algorithms_DataStructures_Graph_AdjacencyList_GraphVertex_1_GetEdge_" data-uid="Advanced.Algorithms.DataStructures.Graph.AdjacencyList.GraphVertex`1.GetEdge*"></a>
206+
<h4 id="Advanced_Algorithms_DataStructures_Graph_AdjacencyList_GraphVertex_1_GetEdge_IGraphVertex__0__" data-uid="Advanced.Algorithms.DataStructures.Graph.AdjacencyList.GraphVertex`1.GetEdge(IGraphVertex{`0})">GetEdge(IGraphVertex&lt;T&gt;)</h4>
207+
<div class="markdown level1 summary"></div>
208+
<div class="markdown level1 conceptual"></div>
209+
<h5 class="decalaration">Declaration</h5>
210+
<div class="codewrapper">
211+
<pre><code class="lang-csharp hljs">public IEdge&lt;T&gt; GetEdge(IGraphVertex&lt;T&gt; targetVertex)</code></pre>
212+
</div>
213+
<h5 class="parameters">Parameters</h5>
214+
<table class="table table-bordered table-striped table-condensed">
215+
<thead>
216+
<tr>
217+
<th>Type</th>
218+
<th>Name</th>
219+
<th>Description</th>
220+
</tr>
221+
</thead>
222+
<tbody>
223+
<tr>
224+
<td><span class="xref">IGraphVertex</span>&lt;T&gt;</td>
225+
<td><span class="parametername">targetVertex</span></td>
226+
<td></td>
227+
</tr>
228+
</tbody>
229+
</table>
230+
<h5 class="returns">Returns</h5>
231+
<table class="table table-bordered table-striped table-condensed">
232+
<thead>
233+
<tr>
234+
<th>Type</th>
235+
<th>Description</th>
236+
</tr>
237+
</thead>
238+
<tbody>
239+
<tr>
240+
<td><span class="xref">IEdge</span>&lt;T&gt;</td>
241+
<td></td>
242+
</tr>
243+
</tbody>
244+
</table>
245+
246+
205247
<a id="Advanced_Algorithms_DataStructures_Graph_AdjacencyList_GraphVertex_1_GetEnumerator_" data-uid="Advanced.Algorithms.DataStructures.Graph.AdjacencyList.GraphVertex`1.GetEnumerator*"></a>
206248
<h4 id="Advanced_Algorithms_DataStructures_Graph_AdjacencyList_GraphVertex_1_GetEnumerator" data-uid="Advanced.Algorithms.DataStructures.Graph.AdjacencyList.GraphVertex`1.GetEnumerator">GetEnumerator()</h4>
207249
<div class="markdown level1 summary"></div>

‎docs/api/Advanced.Algorithms.DataStructures.Graph.AdjacencyList.WeightedDiGraphVertex-2.html‎

Lines changed: 42 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -282,6 +282,48 @@ <h3 id="methods">Methods
282282
</h3>
283283

284284

285+
<a id="Advanced_Algorithms_DataStructures_Graph_AdjacencyList_WeightedDiGraphVertex_2_GetEdge_" data-uid="Advanced.Algorithms.DataStructures.Graph.AdjacencyList.WeightedDiGraphVertex`2.GetEdge*"></a>
286+
<h4 id="Advanced_Algorithms_DataStructures_Graph_AdjacencyList_WeightedDiGraphVertex_2_GetEdge_IGraphVertex__0__" data-uid="Advanced.Algorithms.DataStructures.Graph.AdjacencyList.WeightedDiGraphVertex`2.GetEdge(IGraphVertex{`0})">GetEdge(IGraphVertex&lt;T&gt;)</h4>
287+
<div class="markdown level1 summary"></div>
288+
<div class="markdown level1 conceptual"></div>
289+
<h5 class="decalaration">Declaration</h5>
290+
<div class="codewrapper">
291+
<pre><code class="lang-csharp hljs">public IEdge&lt;T&gt; GetEdge(IGraphVertex&lt;T&gt; targetVertex)</code></pre>
292+
</div>
293+
<h5 class="parameters">Parameters</h5>
294+
<table class="table table-bordered table-striped table-condensed">
295+
<thead>
296+
<tr>
297+
<th>Type</th>
298+
<th>Name</th>
299+
<th>Description</th>
300+
</tr>
301+
</thead>
302+
<tbody>
303+
<tr>
304+
<td><span class="xref">IGraphVertex</span>&lt;T&gt;</td>
305+
<td><span class="parametername">targetVertex</span></td>
306+
<td></td>
307+
</tr>
308+
</tbody>
309+
</table>
310+
<h5 class="returns">Returns</h5>
311+
<table class="table table-bordered table-striped table-condensed">
312+
<thead>
313+
<tr>
314+
<th>Type</th>
315+
<th>Description</th>
316+
</tr>
317+
</thead>
318+
<tbody>
319+
<tr>
320+
<td><span class="xref">IEdge</span>&lt;T&gt;</td>
321+
<td></td>
322+
</tr>
323+
</tbody>
324+
</table>
325+
326+
285327
<a id="Advanced_Algorithms_DataStructures_Graph_AdjacencyList_WeightedDiGraphVertex_2_GetEnumerator_" data-uid="Advanced.Algorithms.DataStructures.Graph.AdjacencyList.WeightedDiGraphVertex`2.GetEnumerator*"></a>
286328
<h4 id="Advanced_Algorithms_DataStructures_Graph_AdjacencyList_WeightedDiGraphVertex_2_GetEnumerator" data-uid="Advanced.Algorithms.DataStructures.Graph.AdjacencyList.WeightedDiGraphVertex`2.GetEnumerator">GetEnumerator()</h4>
287329
<div class="markdown level1 summary"></div>

‎docs/api/Advanced.Algorithms.DataStructures.Graph.AdjacencyList.WeightedGraphVertex-2.html‎

Lines changed: 42 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -206,6 +206,48 @@ <h3 id="methods">Methods
206206
</h3>
207207

208208

209+
<a id="Advanced_Algorithms_DataStructures_Graph_AdjacencyList_WeightedGraphVertex_2_GetEdge_" data-uid="Advanced.Algorithms.DataStructures.Graph.AdjacencyList.WeightedGraphVertex`2.GetEdge*"></a>
210+
<h4 id="Advanced_Algorithms_DataStructures_Graph_AdjacencyList_WeightedGraphVertex_2_GetEdge_IGraphVertex__0__" data-uid="Advanced.Algorithms.DataStructures.Graph.AdjacencyList.WeightedGraphVertex`2.GetEdge(IGraphVertex{`0})">GetEdge(IGraphVertex&lt;T&gt;)</h4>
211+
<div class="markdown level1 summary"></div>
212+
<div class="markdown level1 conceptual"></div>
213+
<h5 class="decalaration">Declaration</h5>
214+
<div class="codewrapper">
215+
<pre><code class="lang-csharp hljs">public IEdge&lt;T&gt; GetEdge(IGraphVertex&lt;T&gt; targetVertex)</code></pre>
216+
</div>
217+
<h5 class="parameters">Parameters</h5>
218+
<table class="table table-bordered table-striped table-condensed">
219+
<thead>
220+
<tr>
221+
<th>Type</th>
222+
<th>Name</th>
223+
<th>Description</th>
224+
</tr>
225+
</thead>
226+
<tbody>
227+
<tr>
228+
<td><span class="xref">IGraphVertex</span>&lt;T&gt;</td>
229+
<td><span class="parametername">targetVertex</span></td>
230+
<td></td>
231+
</tr>
232+
</tbody>
233+
</table>
234+
<h5 class="returns">Returns</h5>
235+
<table class="table table-bordered table-striped table-condensed">
236+
<thead>
237+
<tr>
238+
<th>Type</th>
239+
<th>Description</th>
240+
</tr>
241+
</thead>
242+
<tbody>
243+
<tr>
244+
<td><span class="xref">IEdge</span>&lt;T&gt;</td>
245+
<td></td>
246+
</tr>
247+
</tbody>
248+
</table>
249+
250+
209251
<a id="Advanced_Algorithms_DataStructures_Graph_AdjacencyList_WeightedGraphVertex_2_GetEnumerator_" data-uid="Advanced.Algorithms.DataStructures.Graph.AdjacencyList.WeightedGraphVertex`2.GetEnumerator*"></a>
210252
<h4 id="Advanced_Algorithms_DataStructures_Graph_AdjacencyList_WeightedGraphVertex_2_GetEnumerator" data-uid="Advanced.Algorithms.DataStructures.Graph.AdjacencyList.WeightedGraphVertex`2.GetEnumerator">GetEnumerator()</h4>
211253
<div class="markdown level1 summary"></div>

‎docs/api/Advanced.Algorithms.Graph.AStarShortestPath-2.html‎

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -155,13 +155,13 @@ <h3 id="methods">Methods
155155

156156

157157
<a id="Advanced_Algorithms_Graph_AStarShortestPath_2_FindShortestPath_" data-uid="Advanced.Algorithms.Graph.AStarShortestPath`2.FindShortestPath*"></a>
158-
<h4 id="Advanced_Algorithms_Graph_AStarShortestPath_2_FindShortestPath_IDiGraph__0___0__0_" data-uid="Advanced.Algorithms.Graph.AStarShortestPath`2.FindShortestPath(IDiGraph{`0},`0,`0)">FindShortestPath(IDiGraph&lt;T&gt;, T, T)</h4>
158+
<h4 id="Advanced_Algorithms_Graph_AStarShortestPath_2_FindShortestPath_IGraph__0___0__0_" data-uid="Advanced.Algorithms.Graph.AStarShortestPath`2.FindShortestPath(IGraph{`0},`0,`0)">FindShortestPath(IGraph&lt;T&gt;, T, T)</h4>
159159
<div class="markdown level1 summary"><p>Search path to target using the heuristic.</p>
160160
</div>
161161
<div class="markdown level1 conceptual"></div>
162162
<h5 class="decalaration">Declaration</h5>
163163
<div class="codewrapper">
164-
<pre><code class="lang-csharp hljs">public ShortestPathResult&lt;T, W&gt; FindShortestPath(IDiGraph&lt;T&gt; graph, T source, T destination)</code></pre>
164+
<pre><code class="lang-csharp hljs">public ShortestPathResult&lt;T, W&gt; FindShortestPath(IGraph&lt;T&gt; graph, T source, T destination)</code></pre>
165165
</div>
166166
<h5 class="parameters">Parameters</h5>
167167
<table class="table table-bordered table-striped table-condensed">
@@ -174,7 +174,7 @@ <h5 class="parameters">Parameters</h5>
174174
</thead>
175175
<tbody>
176176
<tr>
177-
<td><span class="xref">IDiGraph</span>&lt;T&gt;</td>
177+
<td><span class="xref">IGraph</span>&lt;T&gt;</td>
178178
<td><span class="parametername">graph</span></td>
179179
<td></td>
180180
</tr>

‎docs/api/Advanced.Algorithms.Graph.BiDirectional-1.html‎

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -117,13 +117,13 @@ <h3 id="methods">Methods
117117

118118

119119
<a id="Advanced_Algorithms_Graph_BiDirectional_1_PathExists_" data-uid="Advanced.Algorithms.Graph.BiDirectional`1.PathExists*"></a>
120-
<h4 id="Advanced_Algorithms_Graph_BiDirectional_1_PathExists_IDiGraph__0___0__0_" data-uid="Advanced.Algorithms.Graph.BiDirectional`1.PathExists(IDiGraph{`0},`0,`0)">PathExists(IDiGraph&lt;T&gt;, T, T)</h4>
120+
<h4 id="Advanced_Algorithms_Graph_BiDirectional_1_PathExists_IGraph__0___0__0_" data-uid="Advanced.Algorithms.Graph.BiDirectional`1.PathExists(IGraph{`0},`0,`0)">PathExists(IGraph&lt;T&gt;, T, T)</h4>
121121
<div class="markdown level1 summary"><p>Returns true if Path exists from source to destination.</p>
122122
</div>
123123
<div class="markdown level1 conceptual"></div>
124124
<h5 class="decalaration">Declaration</h5>
125125
<div class="codewrapper">
126-
<pre><code class="lang-csharp hljs">public bool PathExists(IDiGraph&lt;T&gt; graph, T source, T destination)</code></pre>
126+
<pre><code class="lang-csharp hljs">public bool PathExists(IGraph&lt;T&gt; graph, T source, T destination)</code></pre>
127127
</div>
128128
<h5 class="parameters">Parameters</h5>
129129
<table class="table table-bordered table-striped table-condensed">
@@ -136,7 +136,7 @@ <h5 class="parameters">Parameters</h5>
136136
</thead>
137137
<tbody>
138138
<tr>
139-
<td><span class="xref">IDiGraph</span>&lt;T&gt;</td>
139+
<td><span class="xref">IGraph</span>&lt;T&gt;</td>
140140
<td><span class="parametername">graph</span></td>
141141
<td></td>
142142
</tr>

‎docs/api/Advanced.Algorithms.Graph.DijikstraShortestPath-2.html‎

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -150,13 +150,13 @@ <h3 id="methods">Methods
150150

151151

152152
<a id="Advanced_Algorithms_Graph_DijikstraShortestPath_2_FindShortestPath_" data-uid="Advanced.Algorithms.Graph.DijikstraShortestPath`2.FindShortestPath*"></a>
153-
<h4 id="Advanced_Algorithms_Graph_DijikstraShortestPath_2_FindShortestPath_IDiGraph__0___0__0_" data-uid="Advanced.Algorithms.Graph.DijikstraShortestPath`2.FindShortestPath(IDiGraph{`0},`0,`0)">FindShortestPath(IDiGraph&lt;T&gt;, T, T)</h4>
153+
<h4 id="Advanced_Algorithms_Graph_DijikstraShortestPath_2_FindShortestPath_IGraph__0___0__0_" data-uid="Advanced.Algorithms.Graph.DijikstraShortestPath`2.FindShortestPath(IGraph{`0},`0,`0)">FindShortestPath(IGraph&lt;T&gt;, T, T)</h4>
154154
<div class="markdown level1 summary"><p>Get shortest distance to target.</p>
155155
</div>
156156
<div class="markdown level1 conceptual"></div>
157157
<h5 class="decalaration">Declaration</h5>
158158
<div class="codewrapper">
159-
<pre><code class="lang-csharp hljs">public ShortestPathResult&lt;T, W&gt; FindShortestPath(IDiGraph&lt;T&gt; graph, T source, T destination)</code></pre>
159+
<pre><code class="lang-csharp hljs">public ShortestPathResult&lt;T, W&gt; FindShortestPath(IGraph&lt;T&gt; graph, T source, T destination)</code></pre>
160160
</div>
161161
<h5 class="parameters">Parameters</h5>
162162
<table class="table table-bordered table-striped table-condensed">
@@ -169,7 +169,7 @@ <h5 class="parameters">Parameters</h5>
169169
</thead>
170170
<tbody>
171171
<tr>
172-
<td><span class="xref">IDiGraph</span>&lt;T&gt;</td>
172+
<td><span class="xref">IGraph</span>&lt;T&gt;</td>
173173
<td><span class="parametername">graph</span></td>
174174
<td></td>
175175
</tr>

‎docs/api/Advanced.Algorithms.Graph.MinCut-2.html‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -84,7 +84,7 @@
8484
<h1 id="Advanced_Algorithms_Graph_MinCut_2" data-uid="Advanced.Algorithms.Graph.MinCut`2" class="text-break">Class MinCut&lt;T, W&gt;
8585
</h1>
8686
<div class="markdown level0 summary"><p>Compute minimum cut edges of given graph
87-
using Edmond Karps improved Ford-Fulkerson Max Flow Algorithm.</p>
87+
using Edmond-Karps improved Ford-Fulkerson Max Flow Algorithm.</p>
8888
</div>
8989
<div class="markdown level0 conceptual"></div>
9090
<div class="inheritance">

‎docs/api/Advanced.Algorithms.Graph.TravellingSalesman-2.html‎

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -122,12 +122,12 @@ <h3 id="methods">Methods
122122

123123

124124
<a id="Advanced_Algorithms_Graph_TravellingSalesman_2_FindMinWeight_" data-uid="Advanced.Algorithms.Graph.TravellingSalesman`2.FindMinWeight*"></a>
125-
<h4 id="Advanced_Algorithms_Graph_TravellingSalesman_2_FindMinWeight_IDiGraph__0__Advanced_Algorithms_Graph_IShortestPathOperators__1__" data-uid="Advanced.Algorithms.Graph.TravellingSalesman`2.FindMinWeight(IDiGraph{`0},Advanced.Algorithms.Graph.IShortestPathOperators{`1})">FindMinWeight(IDiGraph&lt;T&gt;, IShortestPathOperators&lt;W&gt;)</h4>
125+
<h4 id="Advanced_Algorithms_Graph_TravellingSalesman_2_FindMinWeight_IGraph__0__Advanced_Algorithms_Graph_IShortestPathOperators__1__" data-uid="Advanced.Algorithms.Graph.TravellingSalesman`2.FindMinWeight(IGraph{`0},Advanced.Algorithms.Graph.IShortestPathOperators{`1})">FindMinWeight(IGraph&lt;T&gt;, IShortestPathOperators&lt;W&gt;)</h4>
126126
<div class="markdown level1 summary"></div>
127127
<div class="markdown level1 conceptual"></div>
128128
<h5 class="decalaration">Declaration</h5>
129129
<div class="codewrapper">
130-
<pre><code class="lang-csharp hljs">public W FindMinWeight(IDiGraph&lt;T&gt; graph, IShortestPathOperators&lt;W&gt; operator)</code></pre>
130+
<pre><code class="lang-csharp hljs">public W FindMinWeight(IGraph&lt;T&gt; graph, IShortestPathOperators&lt;W&gt; operator)</code></pre>
131131
</div>
132132
<h5 class="parameters">Parameters</h5>
133133
<table class="table table-bordered table-striped table-condensed">
@@ -140,7 +140,7 @@ <h5 class="parameters">Parameters</h5>
140140
</thead>
141141
<tbody>
142142
<tr>
143-
<td><span class="xref">IDiGraph</span>&lt;T&gt;</td>
143+
<td><span class="xref">IGraph</span>&lt;T&gt;</td>
144144
<td><span class="parametername">graph</span></td>
145145
<td></td>
146146
</tr>

‎docs/api/Advanced.Algorithms.Graph.html‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -158,7 +158,7 @@ <h4><a class="xref" href="Advanced.Algorithms.Graph.MColorResult-2.html">MColorR
158158
</section>
159159
<h4><a class="xref" href="Advanced.Algorithms.Graph.MinCut-2.html">MinCut&lt;T, W&gt;</a></h4>
160160
<section><p>Compute minimum cut edges of given graph
161-
using Edmond Karps improved Ford-Fulkerson Max Flow Algorithm.</p>
161+
using Edmond-Karps improved Ford-Fulkerson Max Flow Algorithm.</p>
162162
</section>
163163
<h4><a class="xref" href="Advanced.Algorithms.Graph.MinCutEdge-1.html">MinCutEdge&lt;T&gt;</a></h4>
164164
<section><p>Minimum cut result object.</p>

0 commit comments

Comments
 (0)