ADA100% Active LaboratoryLAB
Prim's Algorithm & Cut-Property Edge Selection Lab
Visually grow a minimum spanning tree from an initial vertex across graph cut boundaries using priority queue minimum-weight frontier edges.
DSA • SIMULATIONGraph Traversal & Dijkstra Shortest Path Laboratory
DSA / ADA • GRAPH ALGORITHMSShortest Path & Traversals
Graph Traversal & Dijkstra Shortest Path Laboratory
Start Node:
Step 1 of 7
State Transition
Initialize Dijkstra: dist[A] = 0, all others = ∞.
Dijkstra Shortest Distance Vectorfrom source A
A
0
B
∞
C
∞
D
∞
E
∞
F
∞
Want a step-by-step breakdown from our 4 AI Engineering Agents?
Mastery Standard: Complete all 3 tasks in the Lab Protocol to earn verified mastery credits.
Study Full Unit Notes →