gaspersic/freeCodeCamp
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Update index.md (#30892)

Browse Source 
Add text "### Application 

1. To find all connected components in a given graph
2. To find the shortest path between two nodes of any weighted or unweighted graph
3. To find all nodes within an individual connected components" to article.
This commit is contained in:
Gaurav Bisht
2019-06-23 18:25:09 +05:30
committed by Tom
parent bd829bb63a
commit 3d74d46cfb
1 changed files with 6 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
guide/english/algorithms/graph-algorithms/breadth-first-search/index.md
View File

@@ -18,6 +18,12 @@ Worse Case Time Complexity: O(n)
Breadth First Search is complete on a finite set of nodes and optimal if the cost of moving from one node to another is constant.
### Application
1. To find all connected components in a given graph
2. To find the shortest path between two nodes of any weighted or unweighted graph
3. To find all nodes within an individual connected components
### C++ code for BFS implementation
```cpp