Open acbart opened 4 years ago
Yes, this is something we had though of before, but had not considered any assignments where this was important. But perhaps we should. What kind of assignments/problems are you thinking of where this would make sense?
The particular algorithm was Khan's Algorithm for Topological sorting: https://en.wikipedia.org/wiki/Topological_sorting#Kahn's_algorithm
It apparently allows you to break ties more consistently.
I'm not sure I approve of this idea, but what about removing/deleting an edge or vertex from the graph? There doesn't seem to be a way to do it conveniently through the API.
I'm not sure it's a good idea to let students do this, but I know some graph algorithms that involve such manipulations. I'm fine telling my students to just avoid using that kind of approach, but I thought I should at least raise the issue.