🤖 Few lines describing what your bot does.
Write about 1-2 paragraphs describing the purpose of your bot.
Dijkstra's algorithm is a graph algorithm that finds the shortest path between two nodes in a graph. It works by maintaining a set of nodes that have been visited, and a set of nodes that have not been visited. The algorithm repeatedly expands the set of visited nodes by choosing the node with the lowest cost, and adding its neighbors to the set of visited nodes. The algorithm terminates when the destination node is reached.
git clone https://github.com/yagnesh0312/find_shortest_path_flutter.git
End with an example of getting some data out of the system or using it for a little demo.