0 votes 0 votes For a given set of vertices , can we compute the maximum number of topological sortings possible ? Algorithms algorithms topological-sort normal + – radha gogia asked Jun 30, 2015 retagged Jun 24, 2022 by makhdoom ghaya radha gogia 1.3k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes This question can be form like this , how many DAG (Direct Acyclic Graph) are possible with a given vertex ( say with n vertices ) .If a graph contains any cycle then topological sorting isn`t possible . I think with n vertices number of DAG possible are n! . Pranay Datta 1 answered Jun 30, 2015 Pranay Datta 1 comment Share Follow See 1 comment See all 1 1 comment reply vaishali jhalani commented Jan 24, 2017 reply Follow Share I think it should be (n-1)! 0 votes 0 votes Please log in or register to add a comment.