Home

Welcome to my knowledge base

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.…

Graphs, their traversal and use cases – II

Hi!In our previous blog, we learned about how Graphs can be used to represent common relationships in real life and how we represent graphs in code. In this blog we will learn how to traverse or walk through various nodes in a graph. In this realm of traversing, there are mainly two major methods: BFS…

Introduction Post

Failure is an option here. if things are not failing, you are not innovating. — Elon Musk This is the first post on my new blog. I’m just getting this new blog going, so stay tuned for more. I plan to focus on blogs related to Data Structures, Algorithms and Personal Projects. I will write…


Follow My Blog

Get new content delivered directly to your inbox.

Design a site like this with WordPress.com
Get started