Breath-First Search using Stack
1. BFS using Queue Just in the prior post on graph traversal, we went into details of Depth-First Search (DFS) and Breadth-First Search (BFS). BFS is a way of traversing down the graph, level-by-...
Graph Theory: Search and Traversal
0. Graph Traversal Breadth-First Search (BFS) and Depth-First Search (DFS) are two of the most commonly used graph traversal methods. The traversal of a graph, whether BFS or DFS, involves two ma...
Graph Theory: Introduction
Before heading into details of how we store, represent, and traverse various kinds of graphs, this post is more of a ramp-up to better understand what graphs are and the different kinds from a co...