Graph  14. Bipartite Problem
#14 Bipartite Problem
#14.1 Decide whether a given undirected graph is a bipartite graph
Algorithm
BFS
Java IsBipartite
TODO

Python IsBipartite

#14.2 Maximum Cardinality Bipartite Matching (MCBM)
Some examples of unweighted bipartite matching problem that could use maximum flow algorithm, like FordFulkerson to solve:
 Mice and Owls problem
 Book selection problem
 Elementary Math problem