Count permutations of all integers upto N that can form an acyclic graph based on given conditions | C # implementation of the above approach ; Find the count of possible graphs ; Driver Code
using System ; class GFG { static void possibleAcyclicGraph ( int N ) { Console . Write ( ( int ) Math . Pow ( 2 , N - 1 ) ) ; return ; } public static void Main ( ) { int N = 4 ; possibleAcyclicGraph ( N ) ; } }