algorithms.tutorialhorizon.com

Introduction to Bipartite Graphs OR Bigraphs | Algorithms

Bipartite Graphs OR Bigraphs is a graph whose vertices can be divided into two independent groups or sets, U and V such that each edge in the graph has one end in set U and another end in set V or in other words each edge is either (u, v) which connects edge a vertex from set U to vertex from set V or (v, u) which connects edge a vertex from set V to vertex from set U. No edge will connect to the vertices that belong to the same set.