Graph Traversal Algorithms
In this lesson, we will learn the basic logic behind graph traversal and see how it can be done with two most famous graph traversal algorithms.
We'll cover the following...
Types of graph traversals
Graph traversal means visiting every vertex in the graph. There are two basic techniques used for graph traversal:
- Breadth First Search (BFS)
- Depth First Search (DFS)
In order to understand these algorithms, we will have to view graphs from a slightly different perspective.
Any traversal needs a starting point, but a graph does ...