Search⌘ K
Home
Courses
Data Structures for Coding Interviews in Java

Graph Traversal Algorithms

Explore graph traversal techniques in Java focusing on Breadth First Search and Depth First Search. Understand how to navigate graphs level-wise or depth-wise, and grasp the impact of these algorithms on search efficiency and application scenarios like navigation and social networks.

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:

  1. Breadth First Search (BFS)
...