Class DFS

Depth-First Search (DFS) algorithm DFS is an algorithm for traversing or searching tree or graph data structures. It starts at a chosen node and explores as far as possible along each branch before backtracking.

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']
};
DFS.traverse(graph, 'A'); // returns nodes in DFS order
DFS.findPath(graph, 'A', 'F'); // returns a path from A to F
Copy