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

psf/black code formatting (#1277)

Browse Source
This commit is contained in:
William Zhang
2019-10-05 01:14:13 -04:00
committed by Christian Clauss
parent 07f04a2e55
commit 9eac17a408
291 changed files with 6014 additions and 4571 deletions
Download Patch File Download Diff File Expand all files Collapse all files

26
graphs/dijkstra_algorithm.py
View File

@ -4,6 +4,7 @@
import math
import sys
# For storing the vertex set to retreive node with the lowest distance
@ -12,7 +13,7 @@ class PriorityQueue:
def __init__(self):
self.cur_size = 0
self.array = []
self.pos = {} # To store the pos of node in array
self.pos = {} # To store the pos of node in array
def isEmpty(self):
return self.cur_size == 0
@ -78,8 +79,8 @@ class PriorityQueue:
class Graph:
def __init__(self, num):
self.adjList = {} # To store graph: u -> (v,w)
self.num_nodes = num # Number of nodes in graph
self.adjList = {} # To store graph: u -> (v,w)
self.num_nodes = num # Number of nodes in graph
# To store the distance from source vertex
self.dist = [0] * self.num_nodes
self.par = [-1] * self.num_nodes # To store the path
@ -102,8 +103,11 @@ class Graph:
def show_graph(self):
# u -> v(w)
for u in self.adjList:
print(u, '->', ' -> '.join(str("{}({})".format(v, w))
for v, w in self.adjList[u]))
print(
u,
"->",
" -> ".join(str("{}({})".format(v, w)) for v, w in self.adjList[u]),
)
def dijkstra(self, src):
# Flush old junk values in par[]
@ -137,7 +141,7 @@ class Graph:
def show_distances(self, src):
print("Distance from node: {}".format(src))
for u in range(self.num_nodes):
print('Node {} has distance: {}'.format(u, self.dist[u]))
print("Node {} has distance: {}".format(u, self.dist[u]))
def show_path(self, src, dest):
# To show the shortest path from src to dest
@ -157,16 +161,16 @@ class Graph:
path.append(src)
path.reverse()
print('----Path to reach {} from {}----'.format(dest, src))
print("----Path to reach {} from {}----".format(dest, src))
for u in path:
print('{}'.format(u), end=' ')
print("{}".format(u), end=" ")
if u != dest:
print('-> ', end='')
print("-> ", end="")
print('\nTotal cost of path: ', cost)
print("\nTotal cost of path: ", cost)
if __name__ == '__main__':
if __name__ == "__main__":
graph = Graph(9)
graph.add_edge(0, 1, 4)
graph.add_edge(0, 7, 8)