Interactive program modeling a mountain cable car network as a directed weighted graph. Built from scratch: custom singly linked list (with header node), adjacency-list graph, BFS traversal for reachability, and Dijkstra’s shortest path.
python cli linked-list algorithms graph data-structures breadth-first-search dijkstra-algorithm singly-linked-list shortest-path adjacency-list weighted-graph
-
Updated
Oct 11, 2026 - Python