diff --git a/graph/depth_first_search.cpp b/graph/depth_first_search.cpp
index e3f4e7ece..e99d44fc9 100644
--- a/graph/depth_first_search.cpp
+++ b/graph/depth_first_search.cpp
@@ -54,7 +54,7 @@ namespace graph {
  *
  */
 void addEdge(std::vector<std::vector<size_t>> *adj, size_t u, size_t v) {
-    /**
+    /*
      *
      * Here we are considering undirected graph that's the
      * reason we are adding v to the adjacency list representation of u