Skip to content

DFS implemented (using the BFS API) #253

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 9 commits into from
Apr 9, 2020
Merged

DFS implemented (using the BFS API) #253

Changes from 1 commit
Commits
Show all changes
9 commits
Select commit Hold shift + click to select a range
d408df7
dfs implemented
Harsheet-saxena Apr 8, 2020
c2772f9
Update pydatastructs/graphs/algorithms.py
HarsheetKakar Apr 9, 2020
d424de5
Update pydatastructs/graphs/algorithms.py
HarsheetKakar Apr 9, 2020
a695605
Update pydatastructs/graphs/algorithms.py
HarsheetKakar Apr 9, 2020
12fab63
Update pydatastructs/graphs/algorithms.py
HarsheetKakar Apr 9, 2020
4044b11
Apply suggestions from code review
czgdp1807 Apr 9, 2020
7762209
Apply suggestions from code review
czgdp1807 Apr 9, 2020
59eb324
Apply suggestions from code review
czgdp1807 Apr 9, 2020
cadbaec
Update pydatastructs/graphs/algorithms.py
czgdp1807 Apr 9, 2020
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Prev Previous commit
Next Next commit
Update pydatastructs/graphs/algorithms.py 
Co-Authored-By: Gagandeep Singh <gdp.1807@gmail.com>
  • Loading branch information
@HarsheetKakar @czgdp1807
HarsheetKakar and czgdp1807 authored Apr 9, 2020
commit 12fab63302cbe1ee94f332f116054100ca81f1b5
2 changes: 1 addition & 1 deletion pydatastructs/graphs/algorithms.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -620,7 +620,7 @@ def _depth_first_search_adjacency_list(
next_nodes = graph.neighbors(curr_node)
if len(next_nodes) != 0:
for next_node in next_nodes:
if not next_node.name in visited:
if visited.get(next_node.name, False) is False:
status = operation(curr_node, next_node.name, *args, **kwargs)
if not status:
return None
Expand Down