mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-03-27 00:46:43 +00:00
Code Issues Packages Projects Releases Wiki Activity

1. Removed ;

Browse Source
This commit is contained in:
ashu01 2017-12-31 14:36:29 +05:30
parent 06c7827a94
commit c9debdbd41
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
dynamic_programming/FloydWarshall.py
View File

@ -8,7 +8,7 @@ class Graph:
self.dp = [[math.inf for j in range(0,N)] for i in range(0,N)] # dp[i][j] stores minimum distance from i to j self.dp = [[math.inf for j in range(0,N)] for i in range(0,N)] # dp[i][j] stores minimum distance from i to j
def addEdge(self, u, v, w): def addEdge(self, u, v, w):
self.dp[u][v] = w; self.dp[u][v] = w
def floyd_warshall(self): def floyd_warshall(self):
for k in range(0,self.N): for k in range(0,self.N):