Renamed Function for find Cycle in Directed Graph with DFS

Author: ZigRazor

include/Graph.hpp

@@ -516,7 +516,7 @@ namespace CXXGRAPH
      	* 
      	* @return true if a cycle is detected, else false. ( false is returned also if the graph in indirected)
      	*/
-		const bool isCyclicDFS() const;
+		const bool isCyclicDirectedGraphDFS() const;
 		/**
      	* \brief
      	* This function checks if a graph is directed
@@ -805,7 +805,7 @@ namespace CXXGRAPH
 	}
 
 	template <typename T>
-	const bool Graph<T>::isCyclicDFS() const
+	const bool Graph<T>::isCyclicDirectedGraphDFS() const
 	{
 		if(!isDirectedGraph()){
 			return false;

test/CycleCheckTest.cpp

@@ -15,7 +15,7 @@ TEST(CycleCheckTest, test_1)
     edgeSet.insert(&edge2);
     edgeSet.insert(&edge3);
     CXXGRAPH::Graph<int> graph(edgeSet);
-    bool res= graph.isCyclicDFS();
+    bool res= graph.isCyclicDirectedGraphDFS();
     ASSERT_EQ(res,false);
 }
 
@@ -31,7 +31,7 @@ TEST(CycleCheckTest, test_2)
     edgeSet.insert(&edge1);
     edgeSet.insert(&edge2);
     CXXGRAPH::Graph<int> graph(edgeSet);
-    bool res= graph.isCyclicDFS();
+    bool res= graph.isCyclicDirectedGraphDFS();
     ASSERT_EQ(res,false);
 }
 
@@ -49,7 +49,7 @@ TEST(CycleCheckTest, test_3)
     edgeSet.insert(&edge2);
     edgeSet.insert(&edge3);
     CXXGRAPH::Graph<int> graph(edgeSet);    
-    bool res= graph.isCyclicDFS();
+    bool res= graph.isCyclicDirectedGraphDFS();
     ASSERT_EQ(res,false);
 }
 
@@ -67,7 +67,7 @@ TEST(CycleCheckTest, test_4)
     edgeSet.insert(&edge2);
     edgeSet.insert(&edge3);
     CXXGRAPH::Graph<int> graph(edgeSet);
-    bool res= graph.isCyclicDFS();
+    bool res= graph.isCyclicDirectedGraphDFS();
     ASSERT_EQ(res,true);
 }