-
```java
int maxFlow(int[][] cap, int source, int sink) {
for (int flow = 0; ; ++flow)
if (!augmentPath(cap, new boolean[cap.length], source, sink))
return flow;
}
boolean augmentPa…
-
### Is there an existing issue for this?
- [X] I have searched the existing issues
### Feature Description
I want to add Ford Fulkerson algorithm which is a network flow algorithm in this section
…
-
https://github.com/jwasham/coding-interview-university
-
http://www.infoq.com/cn/news/2012/08/32-most-important-algorithms
1. A* 搜索算法
——图形搜索算法，从给定起点到给定终点计算出路径。其中使用了一种启发式的估算，为每个节点估算通过该节点的最佳路径，并以之为各个地点排定次序。算法以得到的次序访问这些节点。因此，A*搜索算法是最佳优先搜索的范例。
1. 集束搜索（又…
-
:wave: hello, thanks for this repo with the code -- I watched your videos many years ago when I was teaching myself how to code, going to UNL's libraries on the daily (I see you are a fellow Nebraskan…
-
Is your feature request related to a problem? Please describe.
It's a new algo under graph theory that I want to add.
Additional context
Assign the issue to me under SSOC'23 so that I can proceed…
-
**Article:** [Maximum flow - Ford-Fulkerson and Edmonds-Karp](https://cp-algorithms.com/graph/edmonds_karp.html#max-flow-min-cut-theorem)
**Problem:**
-
**Is your feature request related to a problem? Please describe.**
Ford-Fulkerson is a graph algorithm used to find the maximum flow in a flow network. It iteratively finds augmenting paths from th…
-
**Is your feature request related to a problem? Please describe.**
It's a new algo under graph theory that I want to add.
**Additional context**
Assign the issue to me under SSOC'23 so that I can…
-
**Is your feature request related to a problem? Please describe.**
The Stoer-Wagner algorithm is an algorithm for finding the minimum cut in an undirected graph. The minimum cut in a graph is the cut…