smv1999
diff --git a/‎Data Structures/Graphs/Khan_algo.py
+2-3 b/‎Data Structures/Graphs/Khan_algo.py
+2-3
diff --git a/‎Data Structures/Graphs/Adjacency_List.cpp renamed to ‎Data Structures/Graphs/Representation/Adjacency_List.cpp b/‎Data Structures/Graphs/Adjacency_List.cpp renamed to ‎Data Structures/Graphs/Representation/Adjacency_List.cpp
diff --git a/‎Data Structures/Graphs/BFS.py renamed to ‎Data Structures/Graphs/Traversal/BFS.py b/‎Data Structures/Graphs/BFS.py renamed to ‎Data Structures/Graphs/Traversal/BFS.py
diff --git a/‎Data Structures/Graphs/BFSTraversal.cpp renamed to ‎Data Structures/Graphs/Traversal/BFSTraversal.cpp b/‎Data Structures/Graphs/BFSTraversal.cpp renamed to ‎Data Structures/Graphs/Traversal/BFSTraversal.cpp
diff --git a/‎Data Structures/Graphs/DFS.PY renamed to ‎Data Structures/Graphs/Traversal/DFS.py b/‎Data Structures/Graphs/DFS.PY renamed to ‎Data Structures/Graphs/Traversal/DFS.py
diff --git a/‎Data Structures/Graphs/DFSTraversal/DFSTraversal.cpp renamed to ‎Data Structures/Graphs/Traversal/DFSTraversal.cpp b/‎Data Structures/Graphs/DFSTraversal/DFSTraversal.cpp renamed to ‎Data Structures/Graphs/Traversal/DFSTraversal.cpp
diff --git a/‎Data Structures/Graphs/DFSTraversal/in.txt renamed to ‎Data Structures/Graphs/Traversal/in.txt b/‎Data Structures/Graphs/DFSTraversal/in.txt renamed to ‎Data Structures/Graphs/Traversal/in.txt
diff --git a/‎Trie/Trie_add_Search_using_dict.py renamed to ‎Data Structures/Trie/Trie_add_Search_using_dict.py b/‎Trie/Trie_add_Search_using_dict.py renamed to ‎Data Structures/Trie/Trie_add_Search_using_dict.py
diff --git a/‎SilverAndGold.java renamed to ‎General Questions/SilverAndGold.java b/‎SilverAndGold.java renamed to ‎General Questions/SilverAndGold.java
@@ -1,7 +1,6 @@
 '''
-author :saurabh jain
-to find whether a graph has a cycle or not not
-if not than print the topological sorting for them
+to find whether a graph has a cycle or not
+if not then print the topological sorting for them
 '''
 from collections import defaultdict