Skip to content

rscarbel/dijkstras-algorithm

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

215 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Dijkstra's Algorithm

This is a pathfinding algorithm to find the shortest distance between two points. Google/Apple maps uses this kind of algorithm to produce directions.

The paths are weighted - meaning that some routes are harder to travel on than others. In real-life, this could be due to things such as traffic, slow speed limits, or long distances.

It is deployed here.

Dijkstra_algo_screenshot

Technologies Used

  • React
  • Jest
  • HTML
  • CSS
  • JavaScript

What's in this project?

  • Graph data structure to hold the nodes and their connection

  • ui for displaying the graph, not using any library, just raw nonsense HTML and CSS

Other

I have had people watch me build this on discord, which I really enjoy.

About

Implementing the pathfinding algorithm

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

 
 
 

Contributors