Skip to content

Add url and typing hint for BFS #2156

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 13 commits into from
Jun 25, 2020
Merged

Add url and typing hint for BFS #2156

Changes from 8 commits
Commits
Show all changes
13 commits
Select commit Hold shift + click to select a range
c74654e
Add typing for bfs
Jun 25, 2020
7594d81
Add url for BFS
Jun 25, 2020
2cac294
rename the function
Jun 25, 2020
76e680f
Update graphs/bfs.py
Jun 25, 2020
3796d0f
Change the return value type of bfs
Jun 25, 2020
ff831b1
change the function name.
Jun 25, 2020
14d3412
change the function name in annotate
Jun 25, 2020
3131f52
Add one more blank line.
Jun 25, 2020
ae0a548
Delete one blank line.
Jun 25, 2020
b516227
Delete one blank line.
Jun 25, 2020
39be6ba
Update graphs/bfs.py
Jun 25, 2020
e523be6
Update graphs/bfs.py
Jun 25, 2020
b2b6492
Rename bfs.py to breadth_first_search_2.py
cclauss Jun 25, 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
15 changes: 9 additions & 6 deletions graphs/bfs.py
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,4 +1,4 @@
"""
"""https://en.wikipedia.org/wiki/Breadth-first_search
BFS.

pseudo-code:
Expand All @@ -16,6 +16,8 @@

"""

from typing import Set, Dict

G = {
"A": ["B", "C"],
"B": ["A", "D", "E"],
Expand All @@ -26,13 +28,13 @@
}


def bfs(graph, start):
def breadth_first_search(graph: Dict, start: str) -> Set[str]:
"""
>>> ''.join(sorted(bfs(G, 'A')))
>>> ''.join(sorted(breadth_first_search(G, 'A')))
'ABCDEF'
"""
explored, queue = set(), [start] # collections.deque([start])
explored.add(start)
explored = {start}
queue = [start]
while queue:
v = queue.pop(0) # queue.popleft()
for w in graph[v]:
Expand All @@ -43,4 +45,5 @@ def bfs(graph, start):


if __name__ == "__main__":
print(bfs(G, "A"))
print(breadth_first_search(G, "A"))