Graph Notlarım - Bipartite

Giriş
Şeklen şöyle

Bipartite aynı zamanda 2-colorable olarak ta bilinir. Açıklaması şöyle

Start at an arbitrary node, assigning it any of two colors. For each edge that is iterated, give the target node the color different from the one of its parent. If this is not possible, terminate the search as the input is not bipartite. Otherwise, you have generated a 2-coloring of the graph which indicates the two partitions.