Skip to content

This is an implementation of Dijkstra's shortest path algorithm. There are many flaws with it, for example, nodes are stored via vectors rather than hashmaps. Also the system to run the code on github is incomplete

Notifications You must be signed in to change notification settings

lil-rick3/dijkstra-s-shortest-path

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

7 Commits
 
 
 
 
 
 
 
 
 
 

Repository files navigation

dijkstra-s-shortest-path

This program finds the shortest path between two nodes, when given a list of edges between the nodes

Conda environment

Downloading Conda

Creating environment from env

  • In the miniconda terminal, navigate to the repo and execute conda env create -f environment.yml

Activating the environment

  • In the miniconda terminal, execute conda activate dijkstra

Building

With the conda environment active, execute:

  • meson setup build
  • cd build
  • meson compile The executable will be placed in build/src/dijkstra.exe

About

This is an implementation of Dijkstra's shortest path algorithm. There are many flaws with it, for example, nodes are stored via vectors rather than hashmaps. Also the system to run the code on github is incomplete

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published