API documentation update by build server

Author: buildbot121

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

@@ -494,7 +494,9 @@ <h5 class="returns">Returns</h5>
 
   <a id="Advanced_Algorithms_DataStructures_Graph_AdjacencyList_DiGraph_1_RemoveEdge_" data-uid="Advanced.Algorithms.DataStructures.Graph.AdjacencyList.DiGraph`1.RemoveEdge*"></a>
   <h4 id="Advanced_Algorithms_DataStructures_Graph_AdjacencyList_DiGraph_1_RemoveEdge__0__0_" data-uid="Advanced.Algorithms.DataStructures.Graph.AdjacencyList.DiGraph`1.RemoveEdge(`0,`0)">RemoveEdge(T, T)</h4>
-  <div class="markdown level1 summary"></div>
+  <div class="markdown level1 summary"><p>Remove an existing edge between source and destination.
+Time complexity: O(1).</p>
+</div>
   <div class="markdown level1 conceptual"></div>
   <h5 class="decalaration">Declaration</h5>
   <div class="codewrapper">

docs/api/Advanced.Algorithms.DataStructures.Graph.AdjacencyMatrix.DiGraph-1.html

@@ -408,7 +408,9 @@ <h5 class="returns">Returns</h5>
 
   <a id="Advanced_Algorithms_DataStructures_Graph_AdjacencyMatrix_DiGraph_1_RemoveEdge_" data-uid="Advanced.Algorithms.DataStructures.Graph.AdjacencyMatrix.DiGraph`1.RemoveEdge*"></a>
   <h4 id="Advanced_Algorithms_DataStructures_Graph_AdjacencyMatrix_DiGraph_1_RemoveEdge__0__0_" data-uid="Advanced.Algorithms.DataStructures.Graph.AdjacencyMatrix.DiGraph`1.RemoveEdge(`0,`0)">RemoveEdge(T, T)</h4>
-  <div class="markdown level1 summary"></div>
+  <div class="markdown level1 summary"><p>remove an existing edge between source and destination
+Time complexity: O(1).</p>
+</div>
   <div class="markdown level1 conceptual"></div>
   <h5 class="decalaration">Declaration</h5>
   <div class="codewrapper">

docs/api/Advanced.Algorithms.DataStructures.Graph.AdjacencyMatrix.Graph-1.html

@@ -366,7 +366,9 @@ <h5 class="returns">Returns</h5>
 
   <a id="Advanced_Algorithms_DataStructures_Graph_AdjacencyMatrix_Graph_1_RemoveEdge_" data-uid="Advanced.Algorithms.DataStructures.Graph.AdjacencyMatrix.Graph`1.RemoveEdge*"></a>
   <h4 id="Advanced_Algorithms_DataStructures_Graph_AdjacencyMatrix_Graph_1_RemoveEdge__0__0_" data-uid="Advanced.Algorithms.DataStructures.Graph.AdjacencyMatrix.Graph`1.RemoveEdge(`0,`0)">RemoveEdge(T, T)</h4>
-  <div class="markdown level1 summary"></div>
+  <div class="markdown level1 summary"><p>Remove an existing edge between source and destination.
+Time complexity: O(1).</p>
+</div>
   <div class="markdown level1 conceptual"></div>
   <h5 class="decalaration">Declaration</h5>
   <div class="codewrapper">

docs/api/Advanced.Algorithms.Graph.EdmondKarpMaxFlow-2.html

@@ -83,7 +83,9 @@
 
   <h1 id="Advanced_Algorithms_Graph_EdmondKarpMaxFlow_2" data-uid="Advanced.Algorithms.Graph.EdmondKarpMaxFlow`2" class="text-break">Class EdmondKarpMaxFlow&lt;T, W&gt;
   </h1>
-  <div class="markdown level0 summary"></div>
+  <div class="markdown level0 summary"><p>An Edmond Karp max flow implementation on weighted directed graph using 
+adjacency list representation of graph and residual graph.</p>
+</div>
   <div class="markdown level0 conceptual"></div>
   <div class="inheritance">
     <h5>Inheritance</h5>

docs/api/Advanced.Algorithms.Graph.FordFulkersonMaxFlow-2.html

@@ -83,7 +83,9 @@
 
   <h1 id="Advanced_Algorithms_Graph_FordFulkersonMaxFlow_2" data-uid="Advanced.Algorithms.Graph.FordFulkersonMaxFlow`2" class="text-break">Class FordFulkersonMaxFlow&lt;T, W&gt;
   </h1>
-  <div class="markdown level0 summary"></div>
+  <div class="markdown level0 summary"><p>A ford-fulkerson max flox implementation on weighted directed graph using 
+adjacency list representation of graph and residual graph.</p>
+</div>
   <div class="markdown level0 conceptual"></div>
   <div class="inheritance">
     <h5>Inheritance</h5>

docs/api/Advanced.Algorithms.Graph.html

@@ -118,12 +118,16 @@ <h4><a class="xref" href="Advanced.Algorithms.Graph.DijikstraShortestPath-2.html
       <section><p>A dijikstra algorithm implementation using Fibornacci Heap.</p>
 </section>
       <h4><a class="xref" href="Advanced.Algorithms.Graph.EdmondKarpMaxFlow-2.html">EdmondKarpMaxFlow&lt;T, W&gt;</a></h4>
-      <section></section>
+      <section><p>An Edmond Karp max flow implementation on weighted directed graph using 
+adjacency list representation of graph and residual graph.</p>
+</section>
       <h4><a class="xref" href="Advanced.Algorithms.Graph.FloydWarshallShortestPath-2.html">FloydWarshallShortestPath&lt;T, W&gt;</a></h4>
       <section><p>A floyd-warshall shortest path algorithm implementation.</p>
 </section>
       <h4><a class="xref" href="Advanced.Algorithms.Graph.FordFulkersonMaxFlow-2.html">FordFulkersonMaxFlow&lt;T, W&gt;</a></h4>
-      <section></section>
+      <section><p>A ford-fulkerson max flox implementation on weighted directed graph using 
+adjacency list representation of graph and residual graph.</p>
+</section>
       <h4><a class="xref" href="Advanced.Algorithms.Graph.HopcroftKarpMatching-1.html">HopcroftKarpMatching&lt;T&gt;</a></h4>
       <section><p>Compute Max BiParitite Edges using Hopcroft Karp algorithm.</p>
 </section>