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

Ruff check

Browse Source
This commit is contained in:
Prakhar Mittal 2024-10-04 16:24:54 +00:00
parent 3cd92013ab
commit c84aca23a8
1 changed files with 16 additions and 16 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

32
graphs/directed_and_undirected_weighted_graph.py
View File

@ -102,12 +102,12 @@ class DirectedGraph:
stack = []
visited = []
if s == -2:
if self.graph.get(s,None):
pass # -2 is a node
if self.graph.get(s, None):
pass # -2 is a node
elif len(self.graph) > 0:
s = next(iter(self.graph))
else:
return [] # Graph empty
return [] # Graph empty
stack.append(s)
# Run dfs
@ -115,11 +115,11 @@ class DirectedGraph:
s = stack.pop()
visited.append(s)
# If reached d, return
if s==d:
if s == d:
break
# add not visited child nodes to stack
for _,ss in self.graph[s]:
for _, ss in self.graph[s]:
if visited.count(ss) < 1:
stack.append(ss)
return visited
@ -164,12 +164,12 @@ class DirectedGraph:
d = deque()
visited = []
if s == -2:
if self.graph.get(s,None):
pass # -2 is a node
if self.graph.get(s, None):
pass # -2 is a node
elif len(self.graph) > 0:
s = next(iter(self.graph))
else:
return [] # Graph empty
return [] # Graph empty
d.append(s)
visited.append(s)
# Run bfs
@ -413,12 +413,12 @@ class Graph:
stack = []
visited = []
if s == -2:
if self.graph.get(s,None):
pass # -2 is a node
if self.graph.get(s, None):
pass # -2 is a node
elif len(self.graph) > 0:
s = next(iter(self.graph))
else:
return [] # Graph empty
return [] # Graph empty
stack.append(s)
# Run dfs
@ -429,11 +429,11 @@ class Graph:
else:
visited.append(s)
# If reached d, return
if s==d:
if s == d:
break
# add not visited child nodes to stack
for _,ss in self.graph[s]:
for _, ss in self.graph[s]:
if visited.count(ss) < 1:
stack.append(ss)
return visited
@ -478,12 +478,12 @@ class Graph:
d = deque()
visited = []
if s == -2:
if self.graph.get(s,None):
pass # -2 is a node
if self.graph.get(s, None):
pass # -2 is a node
elif len(self.graph) > 0:
s = next(iter(self.graph))
else:
return [] # Graph empty
return [] # Graph empty
d.append(s)
visited.append(s)
while d: