in Programming in C edited by
428 views
0 votes
0 votes

how many topological sort possible for above graph?directions like this question https://gateoverflow.in/39669/gate-cse-2016-set-1-question-11

in Programming in C edited by
428 views

2 Comments

can u modified  ur question ?

if u modified ur question by   putting the direction accorting to which link u here paste then total order is

6!/3!*3!
0
0
Yes same direction as question in link....can you explain how did you get the answer?
0
0

1 Answer

0 votes
0 votes

Topological sort is possible for DAG(directed acyclic graph) having no cycles.