Find the topological sorting for the given graph.

The rule of the sort is: remove the source with the smallest outdegree first, and then remove the source with the largest value.

 

Transcribed Image Text:

18 58 91 62 39 73 93 50 87 90 81 95 25 38 49 99 40 54 18 58 91 62 39 73 93 50 87 90 81 95 25 38 49 99 40 54

Answer rating: 100% (QA)

A topological sort in a directed acyclic graphDAG is a linear ordering of vertices such that foreach... View the full answer