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.