You’re given a directed graph with $n$ vertices and $m$ edges. You need to number the vertices to ensure that every edge leads in the vertex having a smaller sized number allotted to the vertex having a bigger one.
Continue reading “Topological Sorting – Competitive Programming Algorithms”
