Graphs, their traversal and use cases – III

Hi! In the previous posts we learned about the traversal algorithms used on graphs: DFS and BFS. I am sure you have understood the algorithm and are eager to solve some questions using those algorithms. In this post we will discover how to use the algorithms to solve problems. We will solve today is Bicoloring.Continue reading “Graphs, their traversal and use cases – III”

Design a site like this with WordPress.com
Get started