Skip to content
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

Skip list implementation #944

Open
wants to merge 6 commits into
base: master
Choose a base branch
from
+1,110 −3
Open

Skip list implementation #944

Changes from 1 commit
Commits
Show all changes
6 commits
Select commit Hold shift + click to select a range
f55e3c2
update-readme
Aug 8, 2022
13521b2
deploy
Aug 9, 2022
7e8d568
deploy
Aug 25, 2022
ef3b05a
deploy
Aug 26, 2022
a2226c1
deploy
Sep 3, 2022
a4dc327
skip-list-implementation
Oct 5, 2022
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
deploy
name committed Aug 9, 2022
commit 13521b2fc486354a467386e7ed9d092e7992268a
4 changes: 2 additions & 2 deletions src/algorithms/graph/breadth-first-search/README.md
View file
Original file line number Diff line number Diff line change
@@ -1,7 +1,7 @@
# Breadth-First Search (BFS)

Breadth-first search (BFS) is an algorithm for traversing
or searching tree or graph data structures. It starts at
Breadth-first search (BFS) is an algorithm for traversing,
searching tree, or graph data structures. It starts at
the tree root (or some arbitrary node of a graph, sometimes
referred to as a 'search key') and explores the neighbor
nodes first, before moving to the next level neighbors.