Update graph/edmondkarp.ts

mapcrafter2048 · appgurueu · web-flow · commit ab770c32f36d · 2024-10-03T23:40:32.000+05:30
Co-authored-by: Lars Müller &lt;34514239+appgurueu@users.noreply.github.com&gt;
diff --git a/graph/edmondkarp.ts b/graph/edmondkarp.ts
@@ -1,5 +1,4 @@
 /**
- * @function edmondkarp
  * @description Compute the maximum flow from a source node to a sink node. The input graph is in adjacency list form. It is a multidimensional array of edges. graph[i] holds the edges for the i'th node. Each edge is a 2-tuple where the 0'th item is the destination node, and the 1'st item is the edge capacity.
  * @Complexity_Analysis
  * Time complexity: O(V * E^2) where V is the number of vertices and E is the number of edges

Original file line number	Diff line number	Diff line change
`@@ -1,5 +1,4 @@`
`1`	`1`	`/**`
`2`		`- * @function edmondkarp`
`3`	`2`	`* @description Compute the maximum flow from a source node to a sink node. The input graph is in adjacency list form. It is a multidimensional array of edges. graph[i] holds the edges for the i'th node. Each edge is a 2-tuple where the 0'th item is the destination node, and the 1'st item is the edge capacity.`
`4`	`3`	`* @Complexity_Analysis`
`5`	`4`	`* Time complexity: O(V * E^2) where V is the number of vertices and E is the number of edges`