Graph Traversal Algorithms
This lesson will cover the key points to traverse a graph, and will also briefly describe two famous graph algorithms— Breadth First Search and Depth First Search.
We'll cover the following...
Introduction #
There are many applications for graphs, such as the GPS navigation system, shortest path finding, peer to peer networks, crawlers in the search engine, garbage collection (java), and even social networking websites.
Depending upon the problem under, the way we traverse a graph is important, since it can affect the time in which we reach the goal.
Types of Graph Traversals #
There are two basic techniques used for graph traversal:
- Breadth First Search (BFS)