algorithm/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-07-05 01:09:40 +08:00
Code Issues Packages Projects Releases Wiki Activity

Improved readability (#1615)

Browse Source 
* improved readability

* further readability improvements

* removed csv file and added f
This commit is contained in:
GeorgeChambi
2019-12-07 05:39:59 +00:00
committed by Christian Clauss
parent 938dd0bbb5
commit 9eb50cc223
21 changed files with 44 additions and 50 deletions
Download Patch File Download Diff File Expand all files Collapse all files

10
graphs/dijkstra_algorithm.py
View File

@ -106,7 +106,7 @@ class Graph:
print(
u,
"->",
" -> ".join(str("{}({})".format(v, w)) for v, w in self.adjList[u]),
" -> ".join(str(f"{v}({w})") for v, w in self.adjList[u]),
)
def dijkstra(self, src):
@ -139,9 +139,9 @@ class Graph:
self.show_distances(src)
def show_distances(self, src):
print("Distance from node: {}".format(src))
print(f"Distance from node: {src}")
for u in range(self.num_nodes):
print("Node {} has distance: {}".format(u, self.dist[u]))
print(f"Node {u} has distance: {self.dist[u]}")
def show_path(self, src, dest):
# To show the shortest path from src to dest
@ -161,9 +161,9 @@ class Graph:
path.append(src)
path.reverse()
print("----Path to reach {} from {}----".format(dest, src))
print(f"----Path to reach {dest} from {src}----")
for u in path:
print("{}".format(u), end=" ")
print(f"{u}", end=" ")
if u != dest:
print("-> ", end="")