0 votes 0 votes how many topological sort possible for n vetex(except the null graph)??? Algorithms algorithms topological-sort normal + – Hira Thakur asked Nov 29, 2016 • retagged Jun 30, 2022 by makhdoom ghaya Hira Thakur 708 views answer comment Share Follow See 1 comment See all 1 1 comment reply santhoshdevulapally commented Nov 29, 2016 reply Follow Share it varies from graph to graph. consider worst case ,where all vertices are connected to only one vertex. then T(n)=(n-1)T(n-1)...........T(2)=1. 1 votes 1 votes Please log in or register to add a comment.
Best answer 3 votes 3 votes maximum of (n-1)! orders are possible when all n-1 vertices are connected to a single vertex balagangadhar12 answered Dec 14, 2016 • selected Dec 14, 2016 by vijaycs balagangadhar12 comment Share Follow See 1 comment See all 1 1 comment reply Lakshman Bhaiya commented Oct 21, 2018 reply Follow Share It looks like this 0 votes 0 votes Please log in or register to add a comment.
