I am currently working on the “Longest Road” Dag problem, and finished writing my topological sorting algorithm in Java. Currently I am using edges with no value associated to them, and I am wondering how this affects the sorting method.