added comments and more test cases

src/classes/graph/graph.h

@@ -50,20 +50,35 @@ template <typename T> class graph {
     }
   }
 
-  ~graph() { adj.clear(); }
-
-  graph(const graph& g) {
+  /**
+   * @brief Construct a new graph object
+   *
+   * @param g the graph we want to copy
+   */
+  graph(const graph &g) {
     adj = g.adj;
     __elements = g.__elements;
     __type = g.__type;
   }
-  graph& operator=(const graph& g) {
+
+  /**
+   * @brief operator = for the graph class
+   *
+   * @param g the graph we want to copy
+   * @return graph&
+   */
+  graph &operator=(const graph &g) {
     adj = g.adj;
     __elements = g.__elements;
     __type = g.__type;
     return *this;
   }
 
+  /**
+   * @brief Destroy the graph object
+   */
+  ~graph() { adj.clear(); }
+
   /**
    * @brief add_edge function
    * @param u: first node

tests/graph/graph.cc

@@ -193,5 +193,16 @@ TEST_CASE("testing copy constructor") {
   graph<int> g2 = g;
   REQUIRE(g.dfs(1) == g1.dfs(1));
   REQUIRE(g.dfs(1) == g2.dfs(1));
-}
 
+  graph<char> g3("directed");
+  g3.add_edge('a', 'b');
+  g3.add_edge('b', 'd');
+  g3.add_edge('c', 'd');
+  g3.add_edge('w', 'd');
+  g3.add_edge('d', 'a');
+
+  graph<char> g4 = g3;
+  graph<char> g5(g3);
+  REQUIRE(g4.dfs('a') == g3.dfs('a'));
+  REQUIRE(g5.dfs('a') == g3.dfs('a'));
+}