Graph Traversal Visualization MicroSim
Run the Graph Traversal Visualization MicroSim MicroSim Fullscreen
About This MicroSim
This MicroSim animates how graph traversal algorithms explore a small healthcare graph of patients, providers, medications, conditions, and facilities. Depth-First Search dives deep along one branch before backtracking, Breadth-First Search fans out level by level, and Shortest Path finds the fewest-hop route between two nodes. As the algorithm runs, the current node glows yellow, visited nodes turn green, and (for shortest path) the final route is highlighted in orange — making the difference between the strategies visible.
How to Use
Choose a start node and an algorithm (and, for Shortest Path, a target), set the animation speed, and press Start to watch the traversal step through the graph; Pause and Reset let you control it. Follow the "Order so far" list in the info panel to see the exact sequence each algorithm visits, and compare DFS versus BFS from the same start node to see how deep-first and level-first exploration differ.
Iframe Embed Code
You can add this MicroSim to any web page by adding this to your HTML:
1 2 3 4 | |
Lesson Plan
Grade Level
9-12 (High School Geometry)
Duration
10-15 minutes
Prerequisites
TODO: List prerequisites.
Activities
- Exploration (5 min): TODO
- Guided Practice (5 min): TODO
- Assessment (5 min): TODO
Assessment
TODO: List assessment criteria.
References
- TODO: Add references.