AT-CS11 · Data structures
Shortest Path Finder (Dijkstra)
Pick two points on a map and see the shortest route found by Dijkstra's algorithm.
- 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
- AT-CS10Sudoku Solver Using BacktrackingEnter any Sudoku and watch it being solved step by step.
- AT-CS12Text Auto-Complete Using TrieSuggests words as you type, using a trie built from a dictionary.
- AT-CS13File Compression Tool (Huffman Coding)Compresses and restores text files and shows the space saved.
- AT-CS01Student Attendance Management SystemTeachers mark attendance online and students see their percentage subject by subject.