mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2024-11-23 21:11:08 +00:00
Code Issues Packages Projects Releases Wiki Activity

Avoid mutable default arguments (#4691)

Browse Source
This commit is contained in:
Christian Clauss 2021-08-31 06:56:15 +02:00 committed by GitHub
parent 3acca3d1d1
commit 097f830238
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
3 changed files with 7 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
graphs/eulerian_path_and_circuit_for_undirected_graph.py
View File

@ -6,8 +6,8 @@
# using dfs for finding eulerian path traversal
def dfs(u, graph, visited_edge, path=[]):
path = path + [u]
def dfs(u, graph, visited_edge, path=None):
path = (path or []) + [u]
for v in graph[u]:
if visited_edge[u][v] is False:
visited_edge[u][v], visited_edge[v][u] = True, True

4
graphs/frequent_pattern_graph_miner.py
View File

@ -168,11 +168,11 @@ def construct_graph(cluster, nodes):
return graph
def myDFS(graph, start, end, path=[]):
def myDFS(graph, start, end, path=None):
"""
find different DFS walk from given node to Header node
"""
path = path + [start]
path = (path or []) + [start]
if start == end:
paths.append(path)
for node in graph[start]:

6
maths/radix2_fft.py
View File

@ -49,10 +49,10 @@ class FFT:
A*B = 0*x^(-0+0j) + 1*x^(2+0j) + 2*x^(3+0j) + 3*x^(8+0j) + 4*x^(6+0j) + 5*x^(8+0j)
"""
def __init__(self, polyA=[0], polyB=[0]):
def __init__(self, polyA=None, polyB=None):
# Input as list
self.polyA = list(polyA)[:]
self.polyB = list(polyB)[:]
self.polyA = list(polyA or [0])[:]
self.polyB = list(polyB or [0])[:]
# Remove leading zero coefficients
while self.polyA[-1] == 0: