Count permutations of all integers upto N that can form an acyclic graph based on given conditions | Find the count of possible graphs ; Driver Code
function possibleAcyclicGraph ( N ) { document . write ( Math . pow ( 2 , N - 1 ) ) ; return ; } let N = 4 ; possibleAcyclicGraph ( N ) ;