Class BFS

Breadth-First Search (BFS) algorithm BFS is an algorithm for traversing or searching tree or graph data structures. It starts at a chosen node and explores all neighbor nodes at the present depth before moving on to nodes at the next depth level.

Time Complexity: O(V + E) where V is vertices and E is edges Space Complexity: O(V)

Example

const graph = {
  'A': ['B', 'C'],
  'B': ['A', 'D', 'E'],
  'C': ['A', 'F'],
  'D': ['B'],
  'E': ['B', 'F'],
  'F': ['C', 'E']
};
BFS.traverse(graph, 'A'); // returns ['A', 'B', 'C', 'D', 'E', 'F']
BFS.findPath(graph, 'A', 'F'); // returns ['A', 'C', 'F']
Copy