Explain Topological Sorting with example

527views

written 7.2 years ago by

kaivanshah • 280

modified 7.2 years ago by

sanketshingote • 100

Topological sort: It id defined as an ordering of the vertices in a directed acyclic graph, such that if there is a path from u to v, then v appears after u in the ordering.
Types of graphs:

a. The graphs should be directed: otherwise for any edge (u,v) there …

Create a free account to keep reading this post.

and 2 others joined a min ago.

ADD COMMENT EDIT