Implement Depth-First-Search algorithm

Recursive implementation of DFS

The expected input:
	-graph represented as a adjacency list
	-starting node (vertex)

Ouput:
	-path to all other nodes