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
def possibleAcyclicGraph ( N ) : NEW_LINE INDENT print ( pow ( 2 , N - 1 ) ) NEW_LINE return NEW_LINE DEDENT if __name__ == ' _ _ main _ _ ' : NEW_LINE INDENT N = 4 NEW_LINE possibleAcyclicGraph ( N ) NEW_LINE DEDENT