From 46c15d61b858a31bee207f814358de18a5b5330f Mon Sep 17 00:00:00 2001
From: Jakob Olsson <jakobols@kth.se>
Date: Wed, 30 May 2018 09:58:21 +0200
Subject: [PATCH] remove pseudocode
---
dfs.c | 15 ---------------
dongle_infrastructure.c | 15 ---------------
2 files changed, 30 deletions(-)
diff --git a/dfs.c b/dfs.c
index ffb6129..b580cb5 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 44e957b..b31dee2 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];
--
GitLab