DSA 2019

4th semester

2018 (3)

Group B

Q.No 11

Q.No 12

Q.no 13

Q.no 14

Q.no 15

The topological sorting for a directed acyclic graph is the linear ordering of vertices. For every edge U-V of a directed graph, the vertex u will come before vertex v in the ordering. Topological sorting is only possible on DAG. Eg:

Leave a Reply

Your email address will not be published. Required fields are marked *