Hi
I think every time we want to start the topological sort we must start with a node that has no father and don’t need and prequiest(time scheduling). but in Patrik code, it doesn’t matter what vertice we start but I think it’s very important because we must start with a node that doesn’t need anything to finish before that node?
