find-shortest-path-gui

Preview

Installation

1. Install Go https://go.dev/doc/install
2. git clone https://github.com/shurygindv/find-shortest-path-gui
3. cd find-shortest-path-gui
4. go run .

TODOs

1. Add combo-boxes to choose source/destinations nodes ✅
2. Reorganize folder structure ✅
3. Add tests ⌛
4. Redesign default theme
5. Refactor (effective go)

Description

There is a file with a description of the map of the city. Each road has three weights - the maximum bandwith of the road, its current load level as a percentage, and the distance between them. A possible variant of the file structure is given below

N - number of nodes (cities)
X1 Y1 // nodes coordinates
X2 Y2
...
XN YN
M - number of connections.
N1 K1 B1 L1 D1 //which nodes are connected (N1, K1), bandwidth (B1), load level (L1), distance (D1)
N2 K2 B2 L2 D2 
...
NM KM BM LM DM

Links

https://math.hws.edu/eck/cs327_s04/chapter8.pdf

https://algs4.cs.princeton.edu/44sp/

https://www.freecodecamp.org/news/dijkstras-shortest-path-algorithm-visual-introduction/#:~:text=Dijkstra's%20Algorithm%20finds%20the%20shortest,node%20and%20all%20other%20nodes.

https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm

Stack

Go 1.19 +fyne (interface)

Go: https://go.dev/

Fyne: https://fyne.io/