OpenSoure_Repos/TheAlgorithms-Python
1
0
Fork 0
mirror of https://hub.njuu.cf/TheAlgorithms/Python.git synced 2023-10-11 13:06:12 +08:00
Code Issues Packages Projects Releases Wiki Activity

Add doctest to dijkstra-algorithm

Browse Source
This commit is contained in:
lubaso 2023-10-06 23:58:26 -03:00
parent 8679c63752
commit b511783731
1 changed files with 4 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
graphs/dijkstra_2.py
View File

@ -56,9 +56,9 @@ def dijkstra(graph, v, src):
Example: Example:
>>> graph = [[0.0, 2.0, float('inf'), 1.0], >>> graph = [[0.0, 2.0, float('inf'), 1.0],
[2.0, 0.0, 4.0, float('inf')], ... [2.0, 0.0, 4.0, float('inf')],
[float('inf'), 4.0, 0.0, 3.0], ... [float('inf'), 4.0, 0.0, 3.0],
[1.0, float('inf'), 3.0, 0.0]] ... [1.0, float('inf'), 3.0, 0.0]]
>>> dijkstra(graph, 4, 0) >>> dijkstra(graph, 4, 0)
Vertex Distance Vertex Distance
0 0 0 0
@ -102,4 +102,4 @@ if __name__ == "__main__":
graph[src][dst] = weight graph[src][dst] = weight
gsrc = int(input("\nEnter shortest path source:").strip()) gsrc = int(input("\nEnter shortest path source:").strip())
dijkstra(graph, V, gsrc) dijkstra(graph, V, gsrc)