Skip to content

Dijkstra's Shortest Path Algorithm Visualisation - NTU Final Year Project AY20/21

Notifications You must be signed in to change notification settings

tanxh33/visualise-dijkstra

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

20 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Visualisation of Dijkstra's Shortest Path Algorithm

A web application for a school project - Development of a Software Application for Teaching Computer Networking.

What is this?

The application is a tool to help students visualise how Dijkstra's algorithm runs.

Dijkstra's algorithm finds the shortest path between two points in a network, and variants of it are used widely in maps, internet networking, finding cheapest costs of a flight, etc. See the Wikipedia article for more information.

This application lets you:

  • Create your own graph networks
  • Calculate the best (lowest cost) path between two points in the network
  • Watch the algorithm work it out step-by-step, with explanations

Try it out here.


About the code

Built in JavaScript, with MaterializeCSS.

Code for weighted graph implemented with reference to this article by Maiko Miyazaki: Completed JavaScript Data Structure Course, and Here is What I Learned About Graph (+ Dijkstra Algorithm).

A more refactored version of this project, made with TypeScript, can be found in a newer repo.


Tested on Firefox version 86.0 and Chrome version 88.0.4324.190.

About

Dijkstra's Shortest Path Algorithm Visualisation - NTU Final Year Project AY20/21

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published