Working with Graphs & Trees

What graph algorithm pattern is implemented in this code?

function findPath(graph, start, end) {
  const visited = new Set();
  const path = [];
  
  function dfs(vertex) {
    if (vertex === end) return true;
    visited.add(vertex);
    path.push(vertex);
    
    for (let neighbor of graph[vertex]) {
      if (!visited.has(neighbor)) {
        if (dfs(neighbor)) return true;
      }
    }
    
    path.pop();
    return false;
  }
  
  dfs(start);
  return path;
}

Shortest path finding
Cycle detection
Path existence checking with backtracking
This implements path finding with backtracking because: 1) Uses DFS with path tracking, 2) Maintains current path during traversal, 3) Removes vertices when path is unsuccessful (backtracking), 4) Returns first valid path found to destination, 5) Uses recursion for implicit stack management, 6) Handles both successful and unsuccessful paths, 7) Common pattern in maze solving algorithms, 8) Efficient for finding any valid path in a graph.
Topological sorting

Next Question (8/21)