React Dijkstra Algorithm

This project was created as a homework at Plovdiv University.

It's implemented with React.

Description

This application helps you find the nearset path from one node to another based on node coordinates, link lengths or nodes weight.

npm i

npm start host

And open in your browser http://localhost:3123/

Shortcuts to manage your graph:

Ctrl+Click on sheet: Add node

Click on node: Select node

Ctrl+Click on node: Add link from selected node to current

Click on link: Select link

Select nodes and click search button to find nearest path from one node to another. If you select more than 2 nodes, paths are gonna be chained.

Use right sidebar to manage properties of the selected nodes and links. (weight, length etc.)

You can import/export graphes in JSON format.

Click on magic button to load example graph.

Name		Name	Last commit message	Last commit date
Latest commit History 18 Commits
build		build
src		src
.babelrc		.babelrc
.eslintrc.js		.eslintrc.js
.gitignore		.gitignore
.prettierrc		.prettierrc
README.md		README.md
jsconfig.json		jsconfig.json
package-lock.json		package-lock.json
package-scripts.js		package-scripts.js
package.json		package.json
postcss.config.js		postcss.config.js
watch.js		watch.js
webpack.config.js		webpack.config.js