Traverse a graph to minimize the amount of nodes that are alive
A node becomes alive when it is visited and can be killed when all of it’s children have been visited. A child can only be visited if all of it’s parents have been visited For example for this graph