Quiz · 4 questions
🗺️ Graph Algorithms
Weights, shortest paths, and spanning trees
Level 0Curious Beginner
0 XP0/85 lessons0/19 achievements
0/100 XP to next level100 XP to go0% complete
Quiz
01Why can't plain BFS find shortest paths in a WEIGHTED graph?
02Dijkstra's algorithm requires that edge weights be...
03Union-Find (disjoint set union) efficiently answers which question?
04A minimum spanning tree (MST) is...
Hint
It's about connecting everything cheaply, not the route between two specific points.
Comments 0
🔔 Reply notifications (sign in)Sign in — Please sign in to comment.
No comments yet — be the first.