Tiem Cong Nghe

Showing suggestions.

Opening the store's index…
↑↓ to move↵ to openesc to close
Tiem Cong Nghe search
Menu
Tiếng Việt

Medium · O((V + E) log V)

Dijkstra's Algorithm quiz

Pick an answer to see whether it's right, and why. Nothing is saved or sent.

Question 1 of 10

  1. Question 1: current
  2. Question 2: not answered yet
  3. Question 3: not answered yet
  4. Question 4: not answered yet
  5. Question 5: not answered yet
  6. Question 6: not answered yet
  7. Question 7: not answered yet
  8. Question 8: not answered yet
  9. Question 9: not answered yet
  10. Question 10: not answered yet

A directed graph with 6 vertices and these edges (from → to, weight): 0→1 (7), 0→2 (2), 2→1 (3), 1→3 (1), 2→3 (8), 3→4 (2), 2→4 (9). Vertex 5 has no edges. After dijkstra(graph, 0), what is dist[4] and which path does shortestPath give for target 4?

Back to Dijkstra's Algorithm

Take it further

  • AnimationPathfinding

    Pathfinding Maze

    An editable neon maze where BFS, Dijkstra, A* and greedy search race to the goal, step by step

    Free