Question: Describe an algorithm to decide whether a graph is bipartite based on the fact that a graph is bipartite if and only if it is possible to color its vertices two different colors so that no two vertices of the same color are adjacent. The converse of a directed graph G = (V , E), denoted by Gconv, is the directed graph (V , F ), where the set F of edges of Gconv is obtained by reversing the direction of each edge in E.