What is a Bipartite Graph?

A Bipartite Graph is a graph whose vertices can be divided into two sets such that no two vertices within the same set are adjacent.

Topological Sort [Hackerearth]

A Topological sort of a Directed-Acyclic graph G is a linear ordering of all its vertices such that if G contains an edge E (u, v), then u appears before v in the ordering. And if the graph is not acyclic, then no linear ordering is possible.