Skip to content
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.

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

Feature/dijkstra algorithm tests #9965

Closed
Closed
Changes from all commits
Commits
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
57 changes: 52 additions & 5 deletions graphs/dijkstra_2.py
Original file line number Diff line number Diff line change
@@ -1,5 +1,20 @@
def print_dist(dist, v):
print("\nVertex Distance")
"""
Print vertex distances.

Parameters:
dist (list): A list of distances.
v (int): The number of vertices.

Example:
>>> print_dist([0.0, 2.0, 3.0, float('inf')], 4)
Vertex Distance
0 0
1 2
2 3
3 INF
"""
print("Vertex Distance")
for i in range(v):
if dist[i] != float("inf"):
print(i, "\t", int(dist[i]), end="\t")
Expand All @@ -9,6 +24,18 @@ def print_dist(dist, v):


def min_dist(mdist, vset, v):
"""
Find the vertex with the minimum distance.

Parameters:
mdist (list): A list of distances.
vset (list): A list of boolean values indicating visited vertices.
v (int): The number of vertices.

Example:
>>> min_dist([0.0, 2.0, 3.0, float('inf')], [False, True, False, False], 4)
0
"""
min_val = float("inf")
min_ind = -1
for i in range(v):
Expand All @@ -19,6 +46,26 @@ def min_dist(mdist, vset, v):


def dijkstra(graph, v, src):
"""
Implement Dijkstra's algorithm to find the shortest path.

Parameters:
graph (list): The graph represented as an adjacency matrix.
v (int): The number of vertices.
src (int): The source vertex.

Example:
>>> graph = [[0.0, 2.0, float('inf'), 1.0],
... [2.0, 0.0, 4.0, float('inf')],
... [float('inf'), 4.0, 0.0, 3.0],
... [1.0, float('inf'), 3.0, 0.0]]
>>> dijkstra(graph, 4, 0)
Vertex Distance
0 0
1 2
2 3
3 1
"""
mdist = [float("inf") for _ in range(v)]
vset = [False for _ in range(v)]
mdist[src] = 0.0
Expand All @@ -35,12 +82,12 @@ def dijkstra(graph, v, src):
):
mdist[i] = mdist[u] + graph[u][i]

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


if __name__ == "__main__":
V = int(input("Enter number of vertices: ").strip())
E = int(input("Enter number of edges: ").strip())
V = int(input("Enter the number of vertices: ").strip())
E = int(input("Enter the number of edges: ").strip())

graph = [[float("inf") for i in range(V)] for j in range(V)]

Expand All @@ -54,5 +101,5 @@ def dijkstra(graph, v, src):
weight = float(input("Enter weight:").strip())
graph[src][dst] = weight

gsrc = int(input("\nEnter shortest path source:").strip())
gsrc = int(input("\nEnter the shortest path source:").strip())
dijkstra(graph, V, gsrc)
Loading