Data-structures course design where every core structure — chained hash table, booking linked list, circular queue, adjacency-list graph with Dijkstra, and a min-heap — is implemented from scratch without relying on STL containers for the core logic.

Two front-ends over the same data structures: a menu-driven CLI, and a web version served by a hand-written HTTP server with a built-in Dijkstra shortest-path visualization.