Student Blog: Testing Bipartiteness with Monad Transformers by Vasily Alferov

I’m here to tell you about my implementation of the algorithm for testing bipartiteness of graphs. A graph is called bipartite if its vertices can be split into two parts in such way that there are no edges inside one part.