Implement Breadth First Search (BFS)
Open
enhancement
good first issue
Hacktoberfest
- Dominant language
- C++
- Stars
- 2
- Forks
- 1
- PR merge metrics
- No merged PRs in 30d
Description
> Breadth First Search is one of the most simple graph algorithms. It traverses the graph by first checking the current node and then expanding it by adding its successors to the next level. The process is repeated for all nodes in the current level before moving to the next level. If the solution is found the search stops.
Contributor guide
No contributing guide indexed for this repository
Assessment
This issue has not been assessed yet.