Shortest path finder in a map (PROTOTYPE)
This project creates a simple graph(mapy) with 5 nodes that are clickable by user. Output is the shortest path and the corresponding shortest distance. Implementation based on Dijkstra's Algorithm.
This project creates a simple graph(mapy) with 5 nodes that are clickable by user. Output is the shortest path and the corresponding shortest distance. Implementation based on Dijkstra's Algorithm.
Log in or sign up for Devpost to join the conversation.