##
Maximum edges that can be added to DAG so that is remains DAG
November 10, 2016

A DAG is given to us, we need to find maximum number of edges that can be added to this DAG, after which new graph still remain a DAG that means the reformed graph should have maximal number of edges, adding even single edge will create a cycle in graph. The Output for above example… Read More »