[][src]Module algorithms_edu::algo::graph::network_flow::bipartite_check

This file shows you how to determine if a graph is bipartite or not. This can be achieved in linear time by coloring the visited nodes.

  • Time Complexity: O(V + E)

Enums

BipartiteCheckError

Constants

BLACK
RED