Update DFS.PY

Author: sriharsha200

Data Structures/Graphs/DFS.PY

@@ -1,3 +1,5 @@
+#  DFS Traversal of Graph using Adjacency Matrix Representation 
+#  Function To implement DFS (Depth First Search)
 def Depthfirstsearch(matrix,start):
     visit=[start] #Keep Track of Visited elements
     stack=[start] #DFS is implemented using stack
@@ -30,4 +32,4 @@ if __name__ == "__main__":
      start=int(input("Enter the starting vertix\n"))
      ans=Depthfirstsearch(matrix,start)
      print("DFS of the given graph is ",end=" ")
-     print(*ans)  
+     print(*ans)