Working with Graphs & Trees

What is the first phase of which graph algorithm?

function stronglyConnected(graph) {
  const visited = new Set();
  const stack = [];
  
  function dfs1(vertex) {
    visited.add(vertex);
    for (let neighbor of graph[vertex]) {
      if (!visited.has(neighbor)) dfs1(neighbor);
    }
    stack.push(vertex);
  }
  
  // First DFS to fill stack
  for (let vertex in graph) {
    if (!visited.has(vertex)) dfs1(vertex);
  }
}

Breadth-First Search
Topological Sort
Kosaraju's Algorithm
This is the first phase of Kosaraju's Algorithm because: 1) Performs first DFS to fill stack in finishing order, 2) Stack order is crucial for second phase, 3) Part of strongly connected components detection, 4) Prepares for reverse graph traversal, 5) Ensures correct processing order for component discovery, 6) O(V+E) time complexity for this phase, 7) Common in network analysis applications, 8) Essential for finding graph components that are mutually reachable.
Dijkstra's Algorithm

Next Question (13/21)