From c1a2e33f2f0396fc21c93f799cfbd47101bd3dee Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Filip=20Hl=C3=A1sek?= <fhlasek@gmail.com>
Date: Mon, 17 Aug 2020 20:10:03 -0700
Subject: [PATCH] Adjust comment.

---
 graph/depth_first_search.cpp | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

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