Online Demo: https://fatihsennik.github.io/Dijkstra-algorithm-gui-map-for-finding-the-shortest-paths-between-nodes-in-a-graph/
Dijkstra's algorithm is an algorithm for finding the shortest paths between nodes in a graph, which may represent, for example, road networks. It was conceived by computer scientist Edsger W. Dijkstra in 1958 and published three years later. The algorithm exists in many variants; Dijkstra's original variant found the shortest path between two nodes, but a more common variant fixes a single node as the "source" node and finds shortest paths from the source to all other nodes in the graph, producing a shortest-path tree. Read More On Wiki
Click to add nodes and then right click a node and then again right click on another node to link them eachother. You can freely reposition them by dragging nodes according to background map image. In order to create Background map image you can use open streetmap: Open Street Map As for the Fun part, select starting node and then select end node and click to start to get shortest path between selected nodes thanks to Dijkstra's algorithm.
- Built with Bootstrap 4.0!
- JavaScript !
- JQuery !
- HTML-5 !
- D3.JS D3!
- Open Sourced !
- Responsive !
- Set Background Image !
- Export and Import Data as JSON !
- 3 Sample Examples Included !
- Fatih Şennik
MIT License
Copyright (c) 2020 Fatih Şennik
Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
Free Software Senniksoft.com