hxx/javascript-algorithms
1
0
Fork 0
mirror of https://github.moeyy.xyz/https://github.com/trekhleb/javascript-algorithms.git synced 2024-09-20 07:43:04 +08:00
Code Issues Packages Projects Releases Wiki Activity

deploy

Browse Source
This commit is contained in:
name 2022-08-09 16:17:36 -07:00
parent f55e3c2202
commit 13521b2fc4
1 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
src/algorithms/graph/breadth-first-search/README.md
View File

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