Skip to content

Commit fad1989

Browse files
author
buildbot121
committed
API documentation update by build server
1 parent 39081a7 commit fad1989

9 files changed

+57
-270
lines changed

‎docs/api/Advanced.Algorithms.GraphAlgorithms.Cut.MinCut-2.html

-53
Original file line numberDiff line numberDiff line change
@@ -225,59 +225,6 @@ <h5 class="returns">Returns</h5>
225225
</tr>
226226
</tbody>
227227
</table>
228-
229-
230-
<a id="Advanced_Algorithms_GraphAlgorithms_Cut_MinCut_2_GetReachable_" data-uid="Advanced.Algorithms.GraphAlgorithms.Cut.MinCut`2.GetReachable*"></a>
231-
<h4 id="Advanced_Algorithms_GraphAlgorithms_Cut_MinCut_2_GetReachable_Advanced_Algorithms_DataStructures_Graph_AdjacencyList_WeightedDiGraph__0__1__Advanced_Algorithms_DataStructures_Graph_AdjacencyList_WeightedDiGraph__0__1___0_" data-uid="Advanced.Algorithms.GraphAlgorithms.Cut.MinCut`2.GetReachable(Advanced.Algorithms.DataStructures.Graph.AdjacencyList.WeightedDiGraph{`0,`1},Advanced.Algorithms.DataStructures.Graph.AdjacencyList.WeightedDiGraph{`0,`1},`0)">GetReachable(WeightedDiGraph&lt;T, W&gt;, WeightedDiGraph&lt;T, W&gt;, T)</h4>
232-
<div class="markdown level1 summary"><p>Gets a list of reachable vertices in residual graph from source</p>
233-
</div>
234-
<div class="markdown level1 conceptual"></div>
235-
<h5 class="decalaration">Declaration</h5>
236-
<div class="codewrapper">
237-
<pre><code class="lang-csharp hljs">public HashSet&lt;T&gt; GetReachable(WeightedDiGraph&lt;T, W&gt; graph, WeightedDiGraph&lt;T, W&gt; residualGraph, T source)</code></pre>
238-
</div>
239-
<h5 class="parameters">Parameters</h5>
240-
<table class="table table-bordered table-striped table-condensed">
241-
<thead>
242-
<tr>
243-
<th>Type</th>
244-
<th>Name</th>
245-
<th>Description</th>
246-
</tr>
247-
</thead>
248-
<tbody>
249-
<tr>
250-
<td><a class="xref" href="Advanced.Algorithms.DataStructures.Graph.AdjacencyList.WeightedDiGraph-2.html">WeightedDiGraph</a>&lt;T, W&gt;</td>
251-
<td><span class="parametername">graph</span></td>
252-
<td></td>
253-
</tr>
254-
<tr>
255-
<td><a class="xref" href="Advanced.Algorithms.DataStructures.Graph.AdjacencyList.WeightedDiGraph-2.html">WeightedDiGraph</a>&lt;T, W&gt;</td>
256-
<td><span class="parametername">residualGraph</span></td>
257-
<td></td>
258-
</tr>
259-
<tr>
260-
<td><span class="xref">T</span></td>
261-
<td><span class="parametername">source</span></td>
262-
<td></td>
263-
</tr>
264-
</tbody>
265-
</table>
266-
<h5 class="returns">Returns</h5>
267-
<table class="table table-bordered table-striped table-condensed">
268-
<thead>
269-
<tr>
270-
<th>Type</th>
271-
<th>Description</th>
272-
</tr>
273-
</thead>
274-
<tbody>
275-
<tr>
276-
<td><a class="xref" href="https://docs.microsoft.com/dotnet/api/system.collections.generic.hashset-1">HashSet</a>&lt;T&gt;</td>
277-
<td></td>
278-
</tr>
279-
</tbody>
280-
</table>
281228
</article>
282229
</div>
283230

‎docs/api/Advanced.Algorithms.GraphAlgorithms.Flow.EdmondKarpMaxFlow-2.html

+3-3
Original file line numberDiff line numberDiff line change
@@ -228,16 +228,16 @@ <h5 class="returns">Returns</h5>
228228
</table>
229229

230230

231-
<a id="Advanced_Algorithms_GraphAlgorithms_Flow_EdmondKarpMaxFlow_2_ComputeMaxFlowAndReturnResidualGraph_" data-uid="Advanced.Algorithms.GraphAlgorithms.Flow.EdmondKarpMaxFlow`2.ComputeMaxFlowAndReturnResidualGraph*"></a>
232-
<h4 id="Advanced_Algorithms_GraphAlgorithms_Flow_EdmondKarpMaxFlow_2_ComputeMaxFlowAndReturnResidualGraph_Advanced_Algorithms_DataStructures_Graph_AdjacencyList_WeightedDiGraph__0__1___0__0_" data-uid="Advanced.Algorithms.GraphAlgorithms.Flow.EdmondKarpMaxFlow`2.ComputeMaxFlowAndReturnResidualGraph(Advanced.Algorithms.DataStructures.Graph.AdjacencyList.WeightedDiGraph{`0,`1},`0,`0)">ComputeMaxFlowAndReturnResidualGraph(WeightedDiGraph&lt;T, W&gt;, T, T)</h4>
231+
<a id="Advanced_Algorithms_GraphAlgorithms_Flow_EdmondKarpMaxFlow_2_computeMaxFlowAndReturnResidualGraph_" data-uid="Advanced.Algorithms.GraphAlgorithms.Flow.EdmondKarpMaxFlow`2.computeMaxFlowAndReturnResidualGraph*"></a>
232+
<h4 id="Advanced_Algorithms_GraphAlgorithms_Flow_EdmondKarpMaxFlow_2_computeMaxFlowAndReturnResidualGraph_Advanced_Algorithms_DataStructures_Graph_AdjacencyList_WeightedDiGraph__0__1___0__0_" data-uid="Advanced.Algorithms.GraphAlgorithms.Flow.EdmondKarpMaxFlow`2.computeMaxFlowAndReturnResidualGraph(Advanced.Algorithms.DataStructures.Graph.AdjacencyList.WeightedDiGraph{`0,`1},`0,`0)">computeMaxFlowAndReturnResidualGraph(WeightedDiGraph&lt;T, W&gt;, T, T)</h4>
233233
<div class="markdown level1 summary"><p>Compute max flow by searching a path
234234
And then augmenting the residual graph until
235235
no more path exists in residual graph with possible flow</p>
236236
</div>
237237
<div class="markdown level1 conceptual"></div>
238238
<h5 class="decalaration">Declaration</h5>
239239
<div class="codewrapper">
240-
<pre><code class="lang-csharp hljs">public WeightedDiGraph&lt;T, W&gt; ComputeMaxFlowAndReturnResidualGraph(WeightedDiGraph&lt;T, W&gt; graph, T source, T sink)</code></pre>
240+
<pre><code class="lang-csharp hljs">public WeightedDiGraph&lt;T, W&gt; computeMaxFlowAndReturnResidualGraph(WeightedDiGraph&lt;T, W&gt; graph, T source, T sink)</code></pre>
241241
</div>
242242
<h5 class="parameters">Parameters</h5>
243243
<table class="table table-bordered table-striped table-condensed">

‎docs/api/Advanced.Algorithms.GraphAlgorithms.Flow.PushRelabelMaxFlow-2.html

-53
Original file line numberDiff line numberDiff line change
@@ -225,59 +225,6 @@ <h5 class="returns">Returns</h5>
225225
</tr>
226226
</tbody>
227227
</table>
228-
229-
230-
<a id="Advanced_Algorithms_GraphAlgorithms_Flow_PushRelabelMaxFlow_2_ComputeMaxFlowAndReturnFlowPath_" data-uid="Advanced.Algorithms.GraphAlgorithms.Flow.PushRelabelMaxFlow`2.ComputeMaxFlowAndReturnFlowPath*"></a>
231-
<h4 id="Advanced_Algorithms_GraphAlgorithms_Flow_PushRelabelMaxFlow_2_ComputeMaxFlowAndReturnFlowPath_Advanced_Algorithms_DataStructures_Graph_AdjacencyList_WeightedDiGraph__0__1___0__0_" data-uid="Advanced.Algorithms.GraphAlgorithms.Flow.PushRelabelMaxFlow`2.ComputeMaxFlowAndReturnFlowPath(Advanced.Algorithms.DataStructures.Graph.AdjacencyList.WeightedDiGraph{`0,`1},`0,`0)">ComputeMaxFlowAndReturnFlowPath(WeightedDiGraph&lt;T, W&gt;, T, T)</h4>
232-
<div class="markdown level1 summary"><p>Return all flow Paths</p>
233-
</div>
234-
<div class="markdown level1 conceptual"></div>
235-
<h5 class="decalaration">Declaration</h5>
236-
<div class="codewrapper">
237-
<pre><code class="lang-csharp hljs">public List&lt;List&lt;T&gt;&gt; ComputeMaxFlowAndReturnFlowPath(WeightedDiGraph&lt;T, W&gt; graph, T source, T sink)</code></pre>
238-
</div>
239-
<h5 class="parameters">Parameters</h5>
240-
<table class="table table-bordered table-striped table-condensed">
241-
<thead>
242-
<tr>
243-
<th>Type</th>
244-
<th>Name</th>
245-
<th>Description</th>
246-
</tr>
247-
</thead>
248-
<tbody>
249-
<tr>
250-
<td><a class="xref" href="Advanced.Algorithms.DataStructures.Graph.AdjacencyList.WeightedDiGraph-2.html">WeightedDiGraph</a>&lt;T, W&gt;</td>
251-
<td><span class="parametername">graph</span></td>
252-
<td></td>
253-
</tr>
254-
<tr>
255-
<td><span class="xref">T</span></td>
256-
<td><span class="parametername">source</span></td>
257-
<td></td>
258-
</tr>
259-
<tr>
260-
<td><span class="xref">T</span></td>
261-
<td><span class="parametername">sink</span></td>
262-
<td></td>
263-
</tr>
264-
</tbody>
265-
</table>
266-
<h5 class="returns">Returns</h5>
267-
<table class="table table-bordered table-striped table-condensed">
268-
<thead>
269-
<tr>
270-
<th>Type</th>
271-
<th>Description</th>
272-
</tr>
273-
</thead>
274-
<tbody>
275-
<tr>
276-
<td><a class="xref" href="https://docs.microsoft.com/dotnet/api/system.collections.generic.list-1">List</a>&lt;<a class="xref" href="https://docs.microsoft.com/dotnet/api/system.collections.generic.list-1">List</a>&lt;T&gt;&gt;</td>
277-
<td></td>
278-
</tr>
279-
</tbody>
280-
</table>
281228
</article>
282229
</div>
283230

‎docs/api/Advanced.Algorithms.GraphAlgorithms.MinimumSpanningTree.Kruskals-2.html

+11-11
Original file line numberDiff line numberDiff line change
@@ -5,10 +5,10 @@
55
<head>
66
<meta charset="utf-8">
77
<meta http-equiv="X-UA-Compatible" content="IE=edge,chrome=1">
8-
<title>Class Kruskals&lt;T, W&gt;
8+
<title>Class Kruskals&lt;T, TW&gt;
99
| Advanced Algorithms </title>
1010
<meta name="viewport" content="width=device-width">
11-
<meta name="title" content="Class Kruskals&lt;T, W&gt;
11+
<meta name="title" content="Class Kruskals&lt;T, TW&gt;
1212
| Advanced Algorithms ">
1313
<meta name="generator" content="docfx 2.35.2.0">
1414

@@ -81,14 +81,14 @@
8181
<article class="content wrap" id="_content" data-uid="Advanced.Algorithms.GraphAlgorithms.MinimumSpanningTree.Kruskals`2">
8282

8383

84-
<h1 id="Advanced_Algorithms_GraphAlgorithms_MinimumSpanningTree_Kruskals_2" data-uid="Advanced.Algorithms.GraphAlgorithms.MinimumSpanningTree.Kruskals`2" class="text-break">Class Kruskals&lt;T, W&gt;
84+
<h1 id="Advanced_Algorithms_GraphAlgorithms_MinimumSpanningTree_Kruskals_2" data-uid="Advanced.Algorithms.GraphAlgorithms.MinimumSpanningTree.Kruskals`2" class="text-break">Class Kruskals&lt;T, TW&gt;
8585
</h1>
8686
<div class="markdown level0 summary"></div>
8787
<div class="markdown level0 conceptual"></div>
8888
<div class="inheritance">
8989
<h5>Inheritance</h5>
9090
<div class="level0"><a class="xref" href="https://docs.microsoft.com/dotnet/api/system.object">Object</a></div>
91-
<div class="level1"><span class="xref">Kruskals&lt;T, W&gt;</span></div>
91+
<div class="level1"><span class="xref">Kruskals&lt;T, TW&gt;</span></div>
9292
</div>
9393
<div class="inheritedMembers">
9494
<h5>Inherited Members</h5>
@@ -118,8 +118,8 @@ <h6><strong>Namespace</strong>: <a class="xref" href="Advanced.Algorithms.GraphA
118118
<h6><strong>Assembly</strong>: Advanced.Algorithms.dll</h6>
119119
<h5 id="Advanced_Algorithms_GraphAlgorithms_MinimumSpanningTree_Kruskals_2_syntax">Syntax</h5>
120120
<div class="codewrapper">
121-
<pre><code class="lang-csharp hljs">public class Kruskals&lt;T, W&gt;
122-
where W : IComparable</code></pre>
121+
<pre><code class="lang-csharp hljs">public class Kruskals&lt;T, TW&gt;
122+
where TW : IComparable</code></pre>
123123
</div>
124124
<h5 class="typeParameters">Type Parameters</h5>
125125
<table class="table table-bordered table-striped table-condensed">
@@ -135,7 +135,7 @@ <h5 class="typeParameters">Type Parameters</h5>
135135
<td></td>
136136
</tr>
137137
<tr>
138-
<td><span class="parametername">W</span></td>
138+
<td><span class="parametername">TW</span></td>
139139
<td></td>
140140
</tr>
141141
</tbody>
@@ -145,13 +145,13 @@ <h3 id="methods">Methods
145145

146146

147147
<a id="Advanced_Algorithms_GraphAlgorithms_MinimumSpanningTree_Kruskals_2_FindMinimumSpanningTree_" data-uid="Advanced.Algorithms.GraphAlgorithms.MinimumSpanningTree.Kruskals`2.FindMinimumSpanningTree*"></a>
148-
<h4 id="Advanced_Algorithms_GraphAlgorithms_MinimumSpanningTree_Kruskals_2_FindMinimumSpanningTree_Advanced_Algorithms_DataStructures_Graph_AdjacencyList_WeightedGraph__0__1__" data-uid="Advanced.Algorithms.GraphAlgorithms.MinimumSpanningTree.Kruskals`2.FindMinimumSpanningTree(Advanced.Algorithms.DataStructures.Graph.AdjacencyList.WeightedGraph{`0,`1})">FindMinimumSpanningTree(WeightedGraph&lt;T, W&gt;)</h4>
148+
<h4 id="Advanced_Algorithms_GraphAlgorithms_MinimumSpanningTree_Kruskals_2_FindMinimumSpanningTree_Advanced_Algorithms_DataStructures_Graph_AdjacencyList_WeightedGraph__0__1__" data-uid="Advanced.Algorithms.GraphAlgorithms.MinimumSpanningTree.Kruskals`2.FindMinimumSpanningTree(Advanced.Algorithms.DataStructures.Graph.AdjacencyList.WeightedGraph{`0,`1})">FindMinimumSpanningTree(WeightedGraph&lt;T, TW&gt;)</h4>
149149
<div class="markdown level1 summary"><p>Find Minimum Spanning Tree of given weighted graph</p>
150150
</div>
151151
<div class="markdown level1 conceptual"></div>
152152
<h5 class="decalaration">Declaration</h5>
153153
<div class="codewrapper">
154-
<pre><code class="lang-csharp hljs">public List&lt;MSTEdge&lt;T, W&gt;&gt; FindMinimumSpanningTree(WeightedGraph&lt;T, W&gt; graph)</code></pre>
154+
<pre><code class="lang-csharp hljs">public List&lt;MSTEdge&lt;T, TW&gt;&gt; FindMinimumSpanningTree(WeightedGraph&lt;T, TW&gt; graph)</code></pre>
155155
</div>
156156
<h5 class="parameters">Parameters</h5>
157157
<table class="table table-bordered table-striped table-condensed">
@@ -164,7 +164,7 @@ <h5 class="parameters">Parameters</h5>
164164
</thead>
165165
<tbody>
166166
<tr>
167-
<td><a class="xref" href="Advanced.Algorithms.DataStructures.Graph.AdjacencyList.WeightedGraph-2.html">WeightedGraph</a>&lt;T, W&gt;</td>
167+
<td><a class="xref" href="Advanced.Algorithms.DataStructures.Graph.AdjacencyList.WeightedGraph-2.html">WeightedGraph</a>&lt;T, TW&gt;</td>
168168
<td><span class="parametername">graph</span></td>
169169
<td></td>
170170
</tr>
@@ -180,7 +180,7 @@ <h5 class="returns">Returns</h5>
180180
</thead>
181181
<tbody>
182182
<tr>
183-
<td><a class="xref" href="https://docs.microsoft.com/dotnet/api/system.collections.generic.list-1">List</a>&lt;<a class="xref" href="Advanced.Algorithms.GraphAlgorithms.MinimumSpanningTree.MSTEdge-2.html">MSTEdge</a>&lt;T, W&gt;&gt;</td>
183+
<td><a class="xref" href="https://docs.microsoft.com/dotnet/api/system.collections.generic.list-1">List</a>&lt;<a class="xref" href="Advanced.Algorithms.GraphAlgorithms.MinimumSpanningTree.MSTEdge-2.html">MSTEdge</a>&lt;T, TW&gt;&gt;</td>
184184
<td><p>List of MST edges</p>
185185
</td>
186186
</tr>

‎docs/api/Advanced.Algorithms.GraphAlgorithms.MinimumSpanningTree.html

+1-1
Original file line numberDiff line numberDiff line change
@@ -87,7 +87,7 @@ <h1 id="Advanced_Algorithms_GraphAlgorithms_MinimumSpanningTree" data-uid="Advan
8787
<div class="markdown level0 remarks"></div>
8888
<h3 id="classes">Classes
8989
</h3>
90-
<h4><a class="xref" href="Advanced.Algorithms.GraphAlgorithms.MinimumSpanningTree.Kruskals-2.html">Kruskals&lt;T, W&gt;</a></h4>
90+
<h4><a class="xref" href="Advanced.Algorithms.GraphAlgorithms.MinimumSpanningTree.Kruskals-2.html">Kruskals&lt;T, TW&gt;</a></h4>
9191
<section></section>
9292
<h4><a class="xref" href="Advanced.Algorithms.GraphAlgorithms.MinimumSpanningTree.MSTEdge-2.html">MSTEdge&lt;T, W&gt;</a></h4>
9393
<section><p>MST edge object</p>

‎docs/api/Advanced.Algorithms.GraphAlgorithms.TravellingSalesman.html

-62
Original file line numberDiff line numberDiff line change
@@ -168,68 +168,6 @@ <h5 class="returns">Returns</h5>
168168
</tr>
169169
</tbody>
170170
</table>
171-
172-
173-
<a id="Advanced_Algorithms_GraphAlgorithms_TravellingSalesman_GetMinWeight_" data-uid="Advanced.Algorithms.GraphAlgorithms.TravellingSalesman.GetMinWeight*"></a>
174-
<h4 id="Advanced_Algorithms_GraphAlgorithms_TravellingSalesman_GetMinWeight_Advanced_Algorithms_DataStructures_Graph_AdjacencyList_WeightedDiGraphVertex_System_Int32_System_Int32__Advanced_Algorithms_DataStructures_Graph_AdjacencyList_WeightedDiGraphVertex_System_Int32_System_Int32__System_Int32_System_Collections_Generic_HashSet_Advanced_Algorithms_DataStructures_Graph_AdjacencyList_WeightedDiGraphVertex_System_Int32_System_Int32___System_Collections_Generic_Dictionary_System_String_System_Int32__" data-uid="Advanced.Algorithms.GraphAlgorithms.TravellingSalesman.GetMinWeight(Advanced.Algorithms.DataStructures.Graph.AdjacencyList.WeightedDiGraphVertex{System.Int32,System.Int32},Advanced.Algorithms.DataStructures.Graph.AdjacencyList.WeightedDiGraphVertex{System.Int32,System.Int32},System.Int32,System.Collections.Generic.HashSet{Advanced.Algorithms.DataStructures.Graph.AdjacencyList.WeightedDiGraphVertex{System.Int32,System.Int32}},System.Collections.Generic.Dictionary{System.String,System.Int32})">GetMinWeight(WeightedDiGraphVertex&lt;Int32, Int32&gt;, WeightedDiGraphVertex&lt;Int32, Int32&gt;, Int32, HashSet&lt;WeightedDiGraphVertex&lt;Int32, Int32&gt;&gt;, Dictionary&lt;String, Int32&gt;)</h4>
175-
<div class="markdown level1 summary"></div>
176-
<div class="markdown level1 conceptual"></div>
177-
<h5 class="decalaration">Declaration</h5>
178-
<div class="codewrapper">
179-
<pre><code class="lang-csharp hljs">public static int GetMinWeight(WeightedDiGraphVertex&lt;int, int&gt; currentVertex, WeightedDiGraphVertex&lt;int, int&gt; tgtVertex, int remainingVertexCount, HashSet&lt;WeightedDiGraphVertex&lt;int, int&gt;&gt; visited, Dictionary&lt;string, int&gt; cache)</code></pre>
180-
</div>
181-
<h5 class="parameters">Parameters</h5>
182-
<table class="table table-bordered table-striped table-condensed">
183-
<thead>
184-
<tr>
185-
<th>Type</th>
186-
<th>Name</th>
187-
<th>Description</th>
188-
</tr>
189-
</thead>
190-
<tbody>
191-
<tr>
192-
<td><a class="xref" href="Advanced.Algorithms.DataStructures.Graph.AdjacencyList.WeightedDiGraphVertex-2.html">WeightedDiGraphVertex</a>&lt;<a class="xref" href="https://docs.microsoft.com/dotnet/api/system.int32">Int32</a>, <a class="xref" href="https://docs.microsoft.com/dotnet/api/system.int32">Int32</a>&gt;</td>
193-
<td><span class="parametername">currentVertex</span></td>
194-
<td></td>
195-
</tr>
196-
<tr>
197-
<td><a class="xref" href="Advanced.Algorithms.DataStructures.Graph.AdjacencyList.WeightedDiGraphVertex-2.html">WeightedDiGraphVertex</a>&lt;<a class="xref" href="https://docs.microsoft.com/dotnet/api/system.int32">Int32</a>, <a class="xref" href="https://docs.microsoft.com/dotnet/api/system.int32">Int32</a>&gt;</td>
198-
<td><span class="parametername">tgtVertex</span></td>
199-
<td></td>
200-
</tr>
201-
<tr>
202-
<td><a class="xref" href="https://docs.microsoft.com/dotnet/api/system.int32">Int32</a></td>
203-
<td><span class="parametername">remainingVertexCount</span></td>
204-
<td></td>
205-
</tr>
206-
<tr>
207-
<td><a class="xref" href="https://docs.microsoft.com/dotnet/api/system.collections.generic.hashset-1">HashSet</a>&lt;<a class="xref" href="Advanced.Algorithms.DataStructures.Graph.AdjacencyList.WeightedDiGraphVertex-2.html">WeightedDiGraphVertex</a>&lt;<a class="xref" href="https://docs.microsoft.com/dotnet/api/system.int32">Int32</a>, <a class="xref" href="https://docs.microsoft.com/dotnet/api/system.int32">Int32</a>&gt;&gt;</td>
208-
<td><span class="parametername">visited</span></td>
209-
<td></td>
210-
</tr>
211-
<tr>
212-
<td><a class="xref" href="https://docs.microsoft.com/dotnet/api/system.collections.generic.dictionary-2">Dictionary</a>&lt;<a class="xref" href="https://docs.microsoft.com/dotnet/api/system.string">String</a>, <a class="xref" href="https://docs.microsoft.com/dotnet/api/system.int32">Int32</a>&gt;</td>
213-
<td><span class="parametername">cache</span></td>
214-
<td></td>
215-
</tr>
216-
</tbody>
217-
</table>
218-
<h5 class="returns">Returns</h5>
219-
<table class="table table-bordered table-striped table-condensed">
220-
<thead>
221-
<tr>
222-
<th>Type</th>
223-
<th>Description</th>
224-
</tr>
225-
</thead>
226-
<tbody>
227-
<tr>
228-
<td><a class="xref" href="https://docs.microsoft.com/dotnet/api/system.int32">Int32</a></td>
229-
<td></td>
230-
</tr>
231-
</tbody>
232-
</table>
233171
</article>
234172
</div>
235173

‎docs/api/toc.html

+1-1
Original file line numberDiff line numberDiff line change
@@ -572,7 +572,7 @@
572572

573573
<ul class="nav level2">
574574
<li>
575-
<a href="Advanced.Algorithms.GraphAlgorithms.MinimumSpanningTree.Kruskals-2.html" name="" title="Kruskals&lt;T, W&gt;">Kruskals&lt;T, W&gt;</a>
575+
<a href="Advanced.Algorithms.GraphAlgorithms.MinimumSpanningTree.Kruskals-2.html" name="" title="Kruskals&lt;T, TW&gt;">Kruskals&lt;T, TW&gt;</a>
576576
</li>
577577
<li>
578578
<a href="Advanced.Algorithms.GraphAlgorithms.MinimumSpanningTree.MSTEdge-2.html" name="" title="MSTEdge&lt;T, W&gt;">MSTEdge&lt;T, W&gt;</a>

0 commit comments

Comments
 (0)