mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-10-06 05:39:30 +00:00
421ace81ed
* [pre-commit.ci] pre-commit autoupdate updates: - [github.com/astral-sh/ruff-pre-commit: v0.0.285 → v0.0.286](https://github.com/astral-sh/ruff-pre-commit/compare/v0.0.285...v0.0.286) - [github.com/tox-dev/pyproject-fmt: 0.13.1 → 1.1.0](https://github.com/tox-dev/pyproject-fmt/compare/0.13.1...1.1.0) * updating DIRECTORY.md * Fis ruff rules PIE808,PLR1714 --------- Co-authored-by: pre-commit-ci[bot] <66853113+pre-commit-ci[bot]@users.noreply.github.com> Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com> Co-authored-by: Christian Clauss <cclauss@me.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(n)] for i in range(n)
|
|
] # adjacency matrix for weight
|
|
self.dp = [
|
|
[math.inf for j in range(n)] for i in range(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(self.n):
|
|
for i in range(self.n):
|
|
for j in range(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)
|