algorithm/javascript-algorithms
1
0
Fork 0
mirror of https://github.com/trekhleb/javascript-algorithms.git synced 2026-03-13 08:51:02 +08:00
Code Issues Packages Projects Releases Wiki Activity

Malay readme (#927)

Browse Source 
* update-readme

* deploy

* deploy

Co-authored-by: name <your mail>
Co-authored-by: Oleksii Trekhleb <trehleb@gmail.com>
This commit is contained in:
j0pgrm
2022-12-04 23:59:33 -07:00
committed by GitHub
parent a6a4d01f95
commit 2a6f724589
3 changed files with 367 additions and 3 deletions
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) 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.