Skip to content

Add doctests to dijkstra_2.py #11823

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 2 commits into
base: master
Choose a base branch
from
Open

Add doctests to dijkstra_2.py #11823

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
f8fcd55
Fix arg for print_dist function
pratyushbanerjee Oct 6, 2024
451c132
Add doctests to dijkstra_2.py
pratyushbanerjee Oct 6, 2024
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
23 changes: 22 additions & 1 deletion graphs/dijkstra_2.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -9,6 +9,13 @@ def print_dist(dist, v):


def min_dist(mdist, vset, v):
"""
Returns the vertex with the minimum distance from the source vertex\
that has not been visited.

>>> min_dist([0, 1, 6], [True, False, False], 3)
1
"""
min_val = float("inf")
min_ind = -1
for i in range(v):
Expand All @@ -19,6 +26,20 @@ def min_dist(mdist, vset, v):


def dijkstra(graph, v, src):
"""
Calculate the shortest path from source to all other vertices\
using Dijkstra's algorithm.

>>> graph = [[0.0, 1.0, 6.0],\
[float("inf"), 0.0, 3.0],\
[float("inf"), float("inf"), 0.0]]
>>> dijkstra(graph, 3, 0) # doctest: +NORMALIZE_WHITESPACE
<BLANKLINE>
Vertex Distance
0 0
1 1
2 4
"""
mdist = [float("inf") for _ in range(v)]
vset = [False for _ in range(v)]
mdist[src] = 0.0
Expand All @@ -35,7 +56,7 @@ def dijkstra(graph, v, src):
):
mdist[i] = mdist[u] + graph[u][i]

print_dist(mdist, i)
print_dist(mdist, v)


if __name__ == "__main__":
Expand Down