onyx_online/grokking-algorithms
1
0
Fork 0
mirror of https://github.com/onyx-and-iris/grokking-algorithms.git synced 2026-04-16 11:33:34 +00:00
Code Issues Packages Projects Releases Wiki Activity

clean up repo.

Browse Source 
add more notes
This commit is contained in:
onyx-and-iris
2024-02-06 21:53:17 +00:00
parent d552050f7e
commit 3fe14b8ac0
13 changed files with 52 additions and 60 deletions
Download Patch File Download Diff File Expand all files Collapse all files

9
chapter6/README.md Normal file
View File

@@ -0,0 +1,9 @@
# Breadth-First Search
Can tell you if there's a path between A and B and will find the shortest.
In these examples, 1st degree Mango sellers are found before 2nd degree, 2nd before 3rd and so on.
Visted nodes should be stored in a set to ensure no infinite loops.
Running time for BFS on a directed graph: `O(V + E`) where V = vertices, E = edges.