in Algorithms recategorized by
364 views
1 vote
1 vote
Prove or disprove: If a directed graph G contains cycles, then TOPOLOGICAL SORT $(G)$ produces a vertex ordering that minimizes the number of “bad” edges that are inconsistent with the ordering produced.
in Algorithms recategorized by
364 views

Please log in or register to answer this question.

Related questions