DijkstraAlgo 0.0.1

To measure the shortest distance of any nodes or any particular points, we can use this package. By using this package, we will get the shortest path and also the distance.

DijsktraAlgorithm

Dijkstra's algorithm is an algorithm for finding the shortest paths between nodes in a graph. It was conceived by computer scientist Edsger W. Dijkstra in 1956 and published three years later. Here, I used his method in python to find the shortest path and also the distance.

Installing

Run the following code to install on your terminal:

pip install DijkstraAlgorithm

Using

Follow the given way to use it:

'''First Import our module'''
import DijkstraAlgo as da
'''Initializing the Class Attributes'''
x = da.DijkstraAlgorithm()

'''Now pass the arguments through the following method'''
x.dijkstraWithPath(graph, source, destination)  #Here, this graph is about the distance between each nodes.

'''Lets define some methods'''
shortest_path = x.path()
distance = x.distance()
print(*shortest_path)   #It will print the path
print(*distance)         #It will print the distance

Plugins

Few useful links:

Plugin	README
2D Model	https://github.com/MizanMustakim/Dijkstra-s-Shortest-Path-Algorithm/tree/main/Shortest%20Path%20in%202D%20model
3D Model	https://github.com/MizanMustakim/Dijkstra-s-Shortest-Path-Algorithm/tree/main/Shortest%20Path%20in%203D%20model

License

MIT

Free Software, Happy Coding!