- Notifications
You must be signed in to change notification settings - Fork3
This application helps you find the nearset path from one node to another based on node coordinates, link lengths or nodes weight.
kiruh/react-dijkstra-algorithm
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
This project was created as a homework at Plovdiv University.
It's implemented with React.
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 browserhttp://localhost:3123/
Or go see itlive
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.
About
This application helps you find the nearset path from one node to another based on node coordinates, link lengths or nodes weight.
Topics
Resources
Uh oh!
There was an error while loading.Please reload this page.