Graph Theory37 sections · 1633 units
Open in Course

Quiz: Pattern Recognition

Knowledge check

Check Your Understanding

You need to find if there's ANY path between two nodes in an unweighted graph. Which technique should you use?

  1. A.BFS or DFS (either works)
  2. B.Floyd-Warshall
  3. C.Bellman-Ford
  4. D.Dijkstra's algorithm
Start the roadmap to answer the quizzes and solve the challenges