🧭 Path Visualization Tool
-
Updated
Jan 21, 2020 - Java
🧭 Path Visualization Tool
A DSA-focused Java project that simulates the Delhi Metro network using graphs and heaps. Computes shortest routes and fares between stations using Dijkstra and BFS algorithms. Includes a CLI interface and interactive map for route visualization.
Efficient offline route navigation with multi-criteria objectives on mobile devices
Add a description, image, and links to the shortest-path-algorithms topic page so that developers can more easily learn about it.
To associate your repository with the shortest-path-algorithms topic, visit your repo's landing page and select "manage topics."