While solving graph algorithms, We may need to visit and process each node present in the graph. And for that, we must know how to traverse the graphs efficiently,
So, first, we will cover graph traversal, where we gonna see the 2 types of graph traversals, Depth First Search, and Breadth-first Search.
Then we will understand Spanning Trees and will see famous algorithms to find minimum cost spanning tree, basically, a minimum cost spanning tree is a tree from the graph connecting all the vertices with single edges each and that all
Of the lowest cost, so to minimize the cost to connect all the vertices.
What you’ll learn
Who this course is for:
- Who wants to deep dive into graphs?
- Want to solve some super complicated graph Algorithms