From 05789603ab82ac5e00e2e5d415509719066687c8 Mon Sep 17 00:00:00 2001
From: Ayaan Khan <ayaankhan98@gmail.com>
Date: Thu, 25 Jun 2020 15:49:30 +0530
Subject: [PATCH] fix: repeated sentences

---
 graph/connected_components.cpp | 10 +++-------
 1 file changed, 3 insertions(+), 7 deletions(-)

diff --git a/graph/connected_components.cpp b/graph/connected_components.cpp
index ec7ef19e6..e53dbf424 100644
--- a/graph/connected_components.cpp
+++ b/graph/connected_components.cpp
@@ -1,9 +1,9 @@
 /**
  *
  * \file
- * \brief [Connected Components
- * (Connected
- * Components)](https://en.wikipedia.org/wiki/Component_(graph_theory))
+ * \brief [Graph Connected Components
+ * (Connected Components)]
+ * (https://en.wikipedia.org/wiki/Component_(graph_theory))
  *
  * \author [Ayaan Khan](http://github.com/ayaankhan98)
  *
@@ -42,10 +42,7 @@ class graph {
     /** \brief keep track of connected components */
     int connected_components;
 
-    /** \brief Utility function to perform depth first search on graph */
     void depth_first_search();
-
-    /** \brief Utility function that explores given vertex in graph */
     void explore(int, vector<bool> &);
 
  public:
@@ -55,7 +52,6 @@ class graph {
      */
     explicit graph(int n) : adj(n, vector<int>()) { connected_components = 0; }
 
-    /** \brief Function to add a edge between two nodes or vertices of graph */
     void addEdge(int, int);
 
     /**