Skip to content
This repository has been archived by the owner on Jun 11, 2019. It is now read-only.

Latest commit

 

History

History
39 lines (20 loc) · 969 Bytes

README.md

File metadata and controls

39 lines (20 loc) · 969 Bytes

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.

Install locally

npm i

npm start host

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

Or go see it live

Instructions

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.