singularity

singularity 🔎

const graph = {
	"a":["c","b"],
	"b":[],
	"c":["e","d"],
	"d":["b","e"],
	"e":["b"]
};

((graph, node) => {
	let stack = [node];
	//step 1: init stack as array with only node memeber
	while(stack.length){
		// step 2: while stack has members
		popped = stack.pop();
		// step 3: pop one out ...
		console.log(popped);
		// step 4: print it ...
		for (neighbour of graph[popped]){
			// step 5: push all elements of popped in stack
			stack.push(neighbour)
		}
	}
})(graph, 'a');

• python

graph = {
    "a":["b","c"],
    "b":["d"],
    "c":["e"],
    "d":[],
    "e":["d"]
}

def dfs_print(graph, node):
    stack = [node];
    
    while(len(stack)):
        current = stack.pop()
        
        print(current)
        
        for neighbour in graph[current]:
            stack.append(neighbour)

dfs_print(graph, 'a')