diff --git a/dfs.c b/dfs.c
index ffb612902c1a055b59dc93e53c2a56f00d359082..b580cb54d7a23de8e0d1e629ed6d571a04677696 100644
--- a/dfs.c
+++ b/dfs.c
@@ -1,18 +1,3 @@
-/*
-DFS(G,v)   ( v is the vertex where the search starts )
-         Stack S := {};   ( start with an empty stack )
-         for each vertex u, set visited[u] := false;
-         push S, v;
-         while (S is not empty) do
-            u := pop S;
-            if (not visited[u]) then
-               visited[u] := true;
-               for each unvisited neighbour w of u
-                  push S, w;
-            end if
-         end while
-      END DFS()
-*/
 #include "dfs.h"
 
 void stack_enqueue(struct node *n, struct list_head *stack)
diff --git a/dongle_infrastructure.c b/dongle_infrastructure.c
index 44e957b14fccb3c09bc14685abeffc7e21f0bcbd..b31dee2bb7ba44e7dbeaf271fe2c4c1bc7cc270f 100644
--- a/dongle_infrastructure.c
+++ b/dongle_infrastructure.c
@@ -219,21 +219,6 @@ fail:
 	return NULL;
 }
 
-/*
-DFS(G,v)   ( v is the vertex where the search starts )
-         Stack S := {};   ( start with an empty stack )
-         for each vertex u, set visited[u] := false;
-         push S, v;
-         while (S is not empty) do
-            u := pop S;
-            if (not visited[u]) then
-               visited[u] := true;
-               for each unvisited neighbour w of u
-                  push S, w;
-            end if
-         end while
-      END DFS()
-*/
 char *dfs_get_path_name(char *folder_name)
 {
 	char *path, *name, new_path[PATH_MAX];