API documentation update by build server

justcoding121 · Apr 30, 2018 · fad1989 · fad1989
1 parent 39081a7
commit fad1989
Show file tree

Hide file tree

Showing 9 changed files with 57 additions and 270 deletions.
diff --git a/docs/api/Advanced.Algorithms.GraphAlgorithms.Cut.MinCut-2.html b/docs/api/Advanced.Algorithms.GraphAlgorithms.Cut.MinCut-2.html
@@ -225,59 +225,6 @@ <h5 class="returns">Returns</h5>
       </tr>
     </tbody>
   </table>
-
-
-  <a id="Advanced_Algorithms_GraphAlgorithms_Cut_MinCut_2_GetReachable_" data-uid="Advanced.Algorithms.GraphAlgorithms.Cut.MinCut`2.GetReachable*"></a>
-  <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>
-  <div class="markdown level1 summary"><p>Gets a list of reachable vertices in residual graph from source</p>
-</div>
-  <div class="markdown level1 conceptual"></div>
-  <h5 class="decalaration">Declaration</h5>
-  <div class="codewrapper">
-    <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>
-  </div>
-  <h5 class="parameters">Parameters</h5>
-  <table class="table table-bordered table-striped table-condensed">
-    <thead>
-      <tr>
-        <th>Type</th>
-        <th>Name</th>
-        <th>Description</th>
-      </tr>
-    </thead>
-    <tbody>
-      <tr>
-        <td><a class="xref" href="Advanced.Algorithms.DataStructures.Graph.AdjacencyList.WeightedDiGraph-2.html">WeightedDiGraph</a>&lt;T, W&gt;</td>
-        <td><span class="parametername">graph</span></td>
-        <td></td>
-      </tr>
-      <tr>
-        <td><a class="xref" href="Advanced.Algorithms.DataStructures.Graph.AdjacencyList.WeightedDiGraph-2.html">WeightedDiGraph</a>&lt;T, W&gt;</td>
-        <td><span class="parametername">residualGraph</span></td>
-        <td></td>
-      </tr>
-      <tr>
-        <td><span class="xref">T</span></td>
-        <td><span class="parametername">source</span></td>
-        <td></td>
-      </tr>
-    </tbody>
-  </table>
-  <h5 class="returns">Returns</h5>
-  <table class="table table-bordered table-striped table-condensed">
-    <thead>
-      <tr>
-        <th>Type</th>
-        <th>Description</th>
-      </tr>
-    </thead>
-    <tbody>
-      <tr>
-        <td><a class="xref" href="https://docs.microsoft.com/dotnet/api/system.collections.generic.hashset-1">HashSet</a>&lt;T&gt;</td>
-        <td></td>
-      </tr>
-    </tbody>
-  </table>
 </article>
           </div>
 

diff --git a/docs/api/Advanced.Algorithms.GraphAlgorithms.Flow.EdmondKarpMaxFlow-2.html b/docs/api/Advanced.Algorithms.GraphAlgorithms.Flow.EdmondKarpMaxFlow-2.html
@@ -228,16 +228,16 @@ <h5 class="returns">Returns</h5>
   </table>
 
 
-  <a id="Advanced_Algorithms_GraphAlgorithms_Flow_EdmondKarpMaxFlow_2_ComputeMaxFlowAndReturnResidualGraph_" data-uid="Advanced.Algorithms.GraphAlgorithms.Flow.EdmondKarpMaxFlow`2.ComputeMaxFlowAndReturnResidualGraph*"></a>
-  <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>
+  <a id="Advanced_Algorithms_GraphAlgorithms_Flow_EdmondKarpMaxFlow_2_computeMaxFlowAndReturnResidualGraph_" data-uid="Advanced.Algorithms.GraphAlgorithms.Flow.EdmondKarpMaxFlow`2.computeMaxFlowAndReturnResidualGraph*"></a>
+  <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>
   <div class="markdown level1 summary"><p>Compute max flow by searching a path
 And then augmenting the residual graph until
 no more path exists in residual graph with possible flow</p>
 </div>
   <div class="markdown level1 conceptual"></div>
   <h5 class="decalaration">Declaration</h5>
   <div class="codewrapper">
-    <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>
+    <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>
   </div>
   <h5 class="parameters">Parameters</h5>
   <table class="table table-bordered table-striped table-condensed">

diff --git a/docs/api/Advanced.Algorithms.GraphAlgorithms.Flow.PushRelabelMaxFlow-2.html b/docs/api/Advanced.Algorithms.GraphAlgorithms.Flow.PushRelabelMaxFlow-2.html
@@ -225,59 +225,6 @@ <h5 class="returns">Returns</h5>
       </tr>
     </tbody>
   </table>
-
-
-  <a id="Advanced_Algorithms_GraphAlgorithms_Flow_PushRelabelMaxFlow_2_ComputeMaxFlowAndReturnFlowPath_" data-uid="Advanced.Algorithms.GraphAlgorithms.Flow.PushRelabelMaxFlow`2.ComputeMaxFlowAndReturnFlowPath*"></a>
-  <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>
-  <div class="markdown level1 summary"><p>Return all flow Paths</p>
-</div>
-  <div class="markdown level1 conceptual"></div>
-  <h5 class="decalaration">Declaration</h5>
-  <div class="codewrapper">
-    <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>
-  </div>
-  <h5 class="parameters">Parameters</h5>
-  <table class="table table-bordered table-striped table-condensed">
-    <thead>
-      <tr>
-        <th>Type</th>
-        <th>Name</th>
-        <th>Description</th>
-      </tr>
-    </thead>
-    <tbody>
-      <tr>
-        <td><a class="xref" href="Advanced.Algorithms.DataStructures.Graph.AdjacencyList.WeightedDiGraph-2.html">WeightedDiGraph</a>&lt;T, W&gt;</td>
-        <td><span class="parametername">graph</span></td>
-        <td></td>
-      </tr>
-      <tr>
-        <td><span class="xref">T</span></td>
-        <td><span class="parametername">source</span></td>
-        <td></td>
-      </tr>
-      <tr>
-        <td><span class="xref">T</span></td>
-        <td><span class="parametername">sink</span></td>
-        <td></td>
-      </tr>
-    </tbody>
-  </table>
-  <h5 class="returns">Returns</h5>
-  <table class="table table-bordered table-striped table-condensed">
-    <thead>
-      <tr>
-        <th>Type</th>
-        <th>Description</th>
-      </tr>
-    </thead>
-    <tbody>
-      <tr>
-        <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>
-        <td></td>
-      </tr>
-    </tbody>
-  </table>
 </article>
           </div>
 

diff --git a/docs/api/Advanced.Algorithms.GraphAlgorithms.MinimumSpanningTree.Kruskals-2.html b/docs/api/Advanced.Algorithms.GraphAlgorithms.MinimumSpanningTree.Kruskals-2.html
@@ -5,10 +5,10 @@
   <head>
     <meta charset="utf-8">
     <meta http-equiv="X-UA-Compatible" content="IE=edge,chrome=1">
-    <title>Class Kruskals&lt;T, W&gt;
+    <title>Class Kruskals&lt;T, TW&gt;
    | Advanced Algorithms </title>
     <meta name="viewport" content="width=device-width">
-    <meta name="title" content="Class Kruskals&lt;T, W&gt;
+    <meta name="title" content="Class Kruskals&lt;T, TW&gt;
    | Advanced Algorithms ">
     <meta name="generator" content="docfx 2.35.2.0">
 
@@ -81,14 +81,14 @@
             <article class="content wrap" id="_content" data-uid="Advanced.Algorithms.GraphAlgorithms.MinimumSpanningTree.Kruskals`2">
 
 
-  <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;
+  <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;
   </h1>
   <div class="markdown level0 summary"></div>
   <div class="markdown level0 conceptual"></div>
   <div class="inheritance">
     <h5>Inheritance</h5>
     <div class="level0"><a class="xref" href="https://docs.microsoft.com/dotnet/api/system.object">Object</a></div>
-    <div class="level1"><span class="xref">Kruskals&lt;T, W&gt;</span></div>
+    <div class="level1"><span class="xref">Kruskals&lt;T, TW&gt;</span></div>
   </div>
   <div class="inheritedMembers">
     <h5>Inherited Members</h5>
@@ -118,8 +118,8 @@ <h6><strong>Namespace</strong>: <a class="xref" href="Advanced.Algorithms.GraphA
   <h6><strong>Assembly</strong>: Advanced.Algorithms.dll</h6>
   <h5 id="Advanced_Algorithms_GraphAlgorithms_MinimumSpanningTree_Kruskals_2_syntax">Syntax</h5>
   <div class="codewrapper">
-    <pre><code class="lang-csharp hljs">public class Kruskals&lt;T, W&gt;
-    where W : IComparable</code></pre>
+    <pre><code class="lang-csharp hljs">public class Kruskals&lt;T, TW&gt;
+    where TW : IComparable</code></pre>
   </div>
   <h5 class="typeParameters">Type Parameters</h5>
   <table class="table table-bordered table-striped table-condensed">
@@ -135,7 +135,7 @@ <h5 class="typeParameters">Type Parameters</h5>
         <td></td>
       </tr>
       <tr>
-        <td><span class="parametername">W</span></td>
+        <td><span class="parametername">TW</span></td>
         <td></td>
       </tr>
     </tbody>
@@ -145,13 +145,13 @@ <h3 id="methods">Methods
 
 
   <a id="Advanced_Algorithms_GraphAlgorithms_MinimumSpanningTree_Kruskals_2_FindMinimumSpanningTree_" data-uid="Advanced.Algorithms.GraphAlgorithms.MinimumSpanningTree.Kruskals`2.FindMinimumSpanningTree*"></a>
-  <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>
+  <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>
   <div class="markdown level1 summary"><p>Find Minimum Spanning Tree of given weighted graph</p>
 </div>
   <div class="markdown level1 conceptual"></div>
   <h5 class="decalaration">Declaration</h5>
   <div class="codewrapper">
-    <pre><code class="lang-csharp hljs">public List&lt;MSTEdge&lt;T, W&gt;&gt; FindMinimumSpanningTree(WeightedGraph&lt;T, W&gt; graph)</code></pre>
+    <pre><code class="lang-csharp hljs">public List&lt;MSTEdge&lt;T, TW&gt;&gt; FindMinimumSpanningTree(WeightedGraph&lt;T, TW&gt; graph)</code></pre>
   </div>
   <h5 class="parameters">Parameters</h5>
   <table class="table table-bordered table-striped table-condensed">
@@ -164,7 +164,7 @@ <h5 class="parameters">Parameters</h5>
     </thead>
     <tbody>
       <tr>
-        <td><a class="xref" href="Advanced.Algorithms.DataStructures.Graph.AdjacencyList.WeightedGraph-2.html">WeightedGraph</a>&lt;T, W&gt;</td>
+        <td><a class="xref" href="Advanced.Algorithms.DataStructures.Graph.AdjacencyList.WeightedGraph-2.html">WeightedGraph</a>&lt;T, TW&gt;</td>
         <td><span class="parametername">graph</span></td>
         <td></td>
       </tr>
@@ -180,7 +180,7 @@ <h5 class="returns">Returns</h5>
     </thead>
     <tbody>
       <tr>
-        <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>
+        <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>
         <td><p>List of MST edges</p>
 </td>
       </tr>

diff --git a/docs/api/Advanced.Algorithms.GraphAlgorithms.MinimumSpanningTree.html b/docs/api/Advanced.Algorithms.GraphAlgorithms.MinimumSpanningTree.html
@@ -87,7 +87,7 @@ <h1 id="Advanced_Algorithms_GraphAlgorithms_MinimumSpanningTree" data-uid="Advan
   <div class="markdown level0 remarks"></div>
     <h3 id="classes">Classes
   </h3>
-      <h4><a class="xref" href="Advanced.Algorithms.GraphAlgorithms.MinimumSpanningTree.Kruskals-2.html">Kruskals&lt;T, W&gt;</a></h4>
+      <h4><a class="xref" href="Advanced.Algorithms.GraphAlgorithms.MinimumSpanningTree.Kruskals-2.html">Kruskals&lt;T, TW&gt;</a></h4>
       <section></section>
       <h4><a class="xref" href="Advanced.Algorithms.GraphAlgorithms.MinimumSpanningTree.MSTEdge-2.html">MSTEdge&lt;T, W&gt;</a></h4>
       <section><p>MST edge object</p>

diff --git a/docs/api/Advanced.Algorithms.GraphAlgorithms.TravellingSalesman.html b/docs/api/Advanced.Algorithms.GraphAlgorithms.TravellingSalesman.html
@@ -168,68 +168,6 @@ <h5 class="returns">Returns</h5>
       </tr>
     </tbody>
   </table>
-
-
-  <a id="Advanced_Algorithms_GraphAlgorithms_TravellingSalesman_GetMinWeight_" data-uid="Advanced.Algorithms.GraphAlgorithms.TravellingSalesman.GetMinWeight*"></a>
-  <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>
-  <div class="markdown level1 summary"></div>
-  <div class="markdown level1 conceptual"></div>
-  <h5 class="decalaration">Declaration</h5>
-  <div class="codewrapper">
-    <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>
-  </div>
-  <h5 class="parameters">Parameters</h5>
-  <table class="table table-bordered table-striped table-condensed">
-    <thead>
-      <tr>
-        <th>Type</th>
-        <th>Name</th>
-        <th>Description</th>
-      </tr>
-    </thead>
-    <tbody>
-      <tr>
-        <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>
-        <td><span class="parametername">currentVertex</span></td>
-        <td></td>
-      </tr>
-      <tr>
-        <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>
-        <td><span class="parametername">tgtVertex</span></td>
-        <td></td>
-      </tr>
-      <tr>
-        <td><a class="xref" href="https://docs.microsoft.com/dotnet/api/system.int32">Int32</a></td>
-        <td><span class="parametername">remainingVertexCount</span></td>
-        <td></td>
-      </tr>
-      <tr>
-        <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>
-        <td><span class="parametername">visited</span></td>
-        <td></td>
-      </tr>
-      <tr>
-        <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>
-        <td><span class="parametername">cache</span></td>
-        <td></td>
-      </tr>
-    </tbody>
-  </table>
-  <h5 class="returns">Returns</h5>
-  <table class="table table-bordered table-striped table-condensed">
-    <thead>
-      <tr>
-        <th>Type</th>
-        <th>Description</th>
-      </tr>
-    </thead>
-    <tbody>
-      <tr>
-        <td><a class="xref" href="https://docs.microsoft.com/dotnet/api/system.int32">Int32</a></td>
-        <td></td>
-      </tr>
-    </tbody>
-  </table>
 </article>
           </div>
 

diff --git a/docs/api/toc.html b/docs/api/toc.html
@@ -572,7 +572,7 @@
 
                 <ul class="nav level2">
                   <li>
-                    <a href="Advanced.Algorithms.GraphAlgorithms.MinimumSpanningTree.Kruskals-2.html" name="" title="Kruskals&lt;T, W&gt;">Kruskals&lt;T, W&gt;</a>
+                    <a href="Advanced.Algorithms.GraphAlgorithms.MinimumSpanningTree.Kruskals-2.html" name="" title="Kruskals&lt;T, TW&gt;">Kruskals&lt;T, TW&gt;</a>
                   </li>
                   <li>
                     <a href="Advanced.Algorithms.GraphAlgorithms.MinimumSpanningTree.MSTEdge-2.html" name="" title="MSTEdge&lt;T, W&gt;">MSTEdge&lt;T, W&gt;</a>