ATAT Innovation Labs

AT-CS11 · Data structures

Shortest Path Finder (Dijkstra)

Pick two points on a map and see the shortest route found by Dijkstra's algorithm.

Get the cost on WhatsApp

Suits
Sem 3–4
Branches
CSE, ISE, AIML
Type
Software

How it works

Places are stored as nodes and the roads between them as edges with distances. You pick a start and an end. Dijkstra's algorithm always visits the nearest unvisited node next and updates the best known distance to its neighbours. The search is animated so you can see it spread out, and the final shortest route is highlighted with its total distance.

What it does

  • Graph on a map
  • Animated search
  • Distance output

Built with

Python or JavaScript

What you get

  • Working software with full source code
  • Steps to install and run it on your laptop
  • Rough report and explanation of the working
  • Live demo on video call before the final payment

Good to know

  • Features are as listed here. Anything extra is quoted separately.
  • Runs on a normal laptop unless we tell you otherwise.
  • Full reports and PPTs are not included.

Similar projects