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

Add pep8-naming to pre-commit hooks and fixes incorrect naming conventions (#7062)

Browse Source 
* 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:
Caeden
2022-10-12 23:54:20 +01:00
committed by GitHub
parent e2cd982b11
commit 07e991d553
140 changed files with 1552 additions and 1536 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
networking_flow/ford_fulkerson.py
View File

@ -6,7 +6,7 @@ Description:
"""
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 = []
@ -24,11 +24,11 @@ def BFS(graph, s, t, parent):
return True if visited[t] else False
def FordFulkerson(graph, source, sink):
def ford_fulkerson(graph, source, sink):
# This array is filled by BFS and to store path
parent = [-1] * (len(graph))
max_flow = 0
while BFS(graph, source, sink, parent):
while bfs(graph, source, sink, parent):
path_flow = float("Inf")
s = sink
@ -58,4 +58,4 @@ graph = [
]
source, sink = 0, 5
print(FordFulkerson(graph, source, sink))
print(ford_fulkerson(graph, source, sink))

4
networking_flow/minimum_cut.py
View File

@ -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