Please tell the complexity of http://www.geeksforgeeks.org/maximum-bipartite-matching/ ?
And if we use directly Ford-Fulkerson Algorithm, will it be better?
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3831 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | gamegame | 3386 |
10 | ksun48 | 3373 |
# | User | Contrib. |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 160 |
5 | -is-this-fft- | 158 |
6 | awoo | 157 |
7 | adamant | 156 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | Dominater069 | 153 |
Please tell the complexity of http://www.geeksforgeeks.org/maximum-bipartite-matching/ ?
And if we use directly Ford-Fulkerson Algorithm, will it be better?
Name |
---|
Maximum Bipartite Matching with Ford-Fulkerson takes O(VE) time. Using Dinic instead of Ford-Fulkerson (or Edmonds Karp for that matter; note that Edmonds Karp always find the shortest augmenting path instead of finding a random path), you can achieve a complexity of .
Can you plz explain the complexity of the link I provided?
Secondly when and how Ford-Fulkerson Algorithm becomes better?
In the link, the bipartite matching is done using Ford-Fulkerson, so the complexity is O(VE).
I don't understand your second question.
A very good source to learn Max-Flow is CLRS. There's an entire chapter dedicated to network flows. You should read it.