in Algorithms retagged by
1,088 views
2 votes
2 votes

How many Topological Orderings possible?

in Algorithms retagged by
1.1k views

3 Comments

14?
0
0
Is the answer 4???
0
0
2
2

1 Answer

11 votes
11 votes

On solving, Topological sort, we can remove some edges,

i.e., if (a,b), (b,c) and (a,c) then remove (a,c).

5 Comments

how are the unnecessary links removed ?
0
0
for example,

A --> D and D---> B then A ---> B is un-necessary. due to B should be after D and D should be after A. Finally it means B should be after A only., then why to represent A  ---> B ?
6
6

@Shaik Masthan sir there  are many method for topological sort  which method should  apply all  of them having different method  which to use for correct answer in less time.

0
0
it's depend upon question only... But what my suggestion is practice one method and comfortable with that...
1
1
ok sir
0
0