added copy constructor
implement readability
recursive and iterative DFS fro graph
determine neighbor based on node value
minimum cut in graph uses ford fulkerson
code cleanup
code cleanup