Dijkstra's Shortest Path First algorithm implementation
GameOn Production test task source code
This project is an implementation of the Dijkstra's algorithm and also my dive into developing tools under Unity Editor API
- Create your own Graph by dragging its prefab onto the scene or use Demo scene
- Drag Vertices prefab onto the Graph in Hierarchy, making them its children
- Connect the Vertices' by specifying connections in each Vertex's corresponding component
Note: you only need to connect Vertices ONCE, algorithm will sync all pairs - Under Shortest Path component on the Graph specify Start and Finish vertices
- The Shortest Path will be highlighted with Green color, starting Edge will be marked Red
Note: if you want to unpair the Vertices (remove an Edge from the Graph), you have to remove both of them from each other's connections list
Not yet fully supported, try at your own risk
Visual design inspired by EmpireWorld's implementation