mirror of
https://github.com/TheAlgorithms/Python.git
synced 2025-07-05 01:09:40 +08:00
Add pep8-naming to pre-commit hooks and fixes incorrect naming conventions (#7062)
* 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>
This commit is contained in:
@ -10,7 +10,7 @@ test_graph = [
|
||||
]
|
||||
|
||||
|
||||
def BFS(graph, s, t, parent):
|
||||
def bfs(graph, s, t, parent):
|
||||
# Return True if there is node that has not iterated.
|
||||
visited = [False] * len(graph)
|
||||
queue = [s]
|
||||
@ -36,7 +36,7 @@ def mincut(graph, source, sink):
|
||||
max_flow = 0
|
||||
res = []
|
||||
temp = [i[:] for i in graph] # Record original cut, copy.
|
||||
while BFS(graph, source, sink, parent):
|
||||
while bfs(graph, source, sink, parent):
|
||||
path_flow = float("Inf")
|
||||
s = sink
|
||||
|
||||
|
Reference in New Issue
Block a user