If I had a directed graph G with 3 different types of edge weights (edge weight = 1, 2, or 3). Could I run a topological sort algorithm that returns a sorted version of the
