mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-11-23 21:11:08 +00:00
07e991d553
* ci(pre-commit): Add pep8-naming to `pre-commit` hooks (#7038) * refactor: Fix naming conventions (#7038) * Update arithmetic_analysis/lu_decomposition.py Co-authored-by: Christian Clauss <cclauss@me.com> * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci * refactor(lu_decomposition): Replace `NDArray` with `ArrayLike` (#7038) * chore: Fix naming conventions in doctests (#7038) * fix: Temporarily disable project euler problem 104 (#7069) * chore: Fix naming conventions in doctests (#7038) Co-authored-by: Christian Clauss <cclauss@me.com> Co-authored-by: pre-commit-ci[bot] <66853113+pre-commit-ci[bot]@users.noreply.github.com>
43 lines
1.2 KiB
Python
43 lines
1.2 KiB
Python
import math
|
|
|
|
|
|
class Graph:
|
|
def __init__(self, n=0): # a graph with Node 0,1,...,N-1
|
|
self.n = n
|
|
self.w = [
|
|
[math.inf for j in range(0, n)] for i in range(0, n)
|
|
] # adjacency matrix for weight
|
|
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 add_edge(self, u, v, w):
|
|
self.dp[u][v] = w
|
|
|
|
def floyd_warshall(self):
|
|
for k in range(0, self.n):
|
|
for i in range(0, self.n):
|
|
for j in range(0, self.n):
|
|
self.dp[i][j] = min(self.dp[i][j], self.dp[i][k] + self.dp[k][j])
|
|
|
|
def show_min(self, u, v):
|
|
return self.dp[u][v]
|
|
|
|
|
|
if __name__ == "__main__":
|
|
graph = Graph(5)
|
|
graph.add_edge(0, 2, 9)
|
|
graph.add_edge(0, 4, 10)
|
|
graph.add_edge(1, 3, 5)
|
|
graph.add_edge(2, 3, 7)
|
|
graph.add_edge(3, 0, 10)
|
|
graph.add_edge(3, 1, 2)
|
|
graph.add_edge(3, 2, 1)
|
|
graph.add_edge(3, 4, 6)
|
|
graph.add_edge(4, 1, 3)
|
|
graph.add_edge(4, 2, 4)
|
|
graph.add_edge(4, 3, 9)
|
|
graph.floyd_warshall()
|
|
graph.show_min(1, 4)
|
|
graph.show_min(0, 3)
|