mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-10-06 13:49:30 +00:00
4d0c830d2c
* ci(pre-commit): Add ``flake8-builtins`` additional dependency to ``pre-commit`` (#7104) * refactor: Fix ``flake8-builtins`` (#7104) * fix(lru_cache): Fix naming conventions in docstrings (#7104) * ci(pre-commit): Order additional dependencies alphabetically (#7104) * fix(lfu_cache): Correct function name in docstring (#7104) * Update strings/snake_case_to_camel_pascal_case.py Co-authored-by: Christian Clauss <cclauss@me.com> * Update data_structures/stacks/next_greater_element.py Co-authored-by: Christian Clauss <cclauss@me.com> * Update digital_image_processing/index_calculation.py Co-authored-by: Christian Clauss <cclauss@me.com> * Update graphs/prim.py Co-authored-by: Christian Clauss <cclauss@me.com> * Update hashes/djb2.py Co-authored-by: Christian Clauss <cclauss@me.com> * refactor: Rename `_builtin` to `builtin_` ( #7104) * fix: Rename all instances (#7104) * refactor: Update variable names (#7104) * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci * ci: Create ``tox.ini`` and ignore ``A003`` (#7123) * revert: Remove function name changes (#7104) * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci * Rename tox.ini to .flake8 * Update data_structures/heap/heap.py Co-authored-by: Dhruv Manilawala <dhruvmanila@gmail.com> * refactor: Rename `next_` to `next_item` (#7104) * ci(pre-commit): Add `flake8` plugin `flake8-bugbear` (#7127) * refactor: Follow `flake8-bugbear` plugin (#7127) * fix: Correct `knapsack` code (#7127) * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci Co-authored-by: Christian Clauss <cclauss@me.com> Co-authored-by: pre-commit-ci[bot] <66853113+pre-commit-ci[bot]@users.noreply.github.com> Co-authored-by: Dhruv Manilawala <dhruvmanila@gmail.com>
59 lines
1.5 KiB
Python
59 lines
1.5 KiB
Python
def print_dist(dist, v):
|
|
print("\nVertex Distance")
|
|
for i in range(v):
|
|
if dist[i] != float("inf"):
|
|
print(i, "\t", int(dist[i]), end="\t")
|
|
else:
|
|
print(i, "\t", "INF", end="\t")
|
|
print()
|
|
|
|
|
|
def min_dist(mdist, vset, v):
|
|
min_val = float("inf")
|
|
min_ind = -1
|
|
for i in range(v):
|
|
if (not vset[i]) and mdist[i] < min_val:
|
|
min_ind = i
|
|
min_val = mdist[i]
|
|
return min_ind
|
|
|
|
|
|
def dijkstra(graph, v, src):
|
|
mdist = [float("inf") for _ in range(v)]
|
|
vset = [False for _ in range(v)]
|
|
mdist[src] = 0.0
|
|
|
|
for _ in range(v - 1):
|
|
u = min_dist(mdist, vset, v)
|
|
vset[u] = True
|
|
|
|
for i in range(v):
|
|
if (
|
|
(not vset[i])
|
|
and graph[u][i] != float("inf")
|
|
and mdist[u] + graph[u][i] < mdist[i]
|
|
):
|
|
mdist[i] = mdist[u] + graph[u][i]
|
|
|
|
print_dist(mdist, i)
|
|
|
|
|
|
if __name__ == "__main__":
|
|
V = int(input("Enter number of vertices: ").strip())
|
|
E = int(input("Enter number of edges: ").strip())
|
|
|
|
graph = [[float("inf") for i in range(V)] for j in range(V)]
|
|
|
|
for i in range(V):
|
|
graph[i][i] = 0.0
|
|
|
|
for i in range(E):
|
|
print("\nEdge ", i + 1)
|
|
src = int(input("Enter source:").strip())
|
|
dst = int(input("Enter destination:").strip())
|
|
weight = float(input("Enter weight:").strip())
|
|
graph[src][dst] = weight
|
|
|
|
gsrc = int(input("\nEnter shortest path source:").strip())
|
|
dijkstra(graph, V, gsrc)
|