DiazCarrete, 6 months ago (edited 6 months ago) IIUC, of the two main algorithms for topological sorting in directed acyclic graphs, only Kahn's algorithm allows you to give extra priority to some vertices, so that they appear earlier in the resulting ordering. 🔗https://en.wikipedia.org/wiki/Topological_sorting 🔗 https://jgrapht.org/javadoc-1.0.0/org/jgrapht/traverse/TopologicalOrderIterator.html#TopologicalOrderIterator-org.jgrapht.DirectedGraph-java.util.Queue- 🔗 https://www.cs.fsu.edu/~lacher/lectures/Output/graphs1/slide09.html
IIUC, of the two main algorithms for topological sorting in directed acyclic graphs, only Kahn's algorithm allows you to give extra priority to some vertices, so that they appear earlier in the resulting ordering.
🔗https://en.wikipedia.org/wiki/Topological_sorting 🔗 https://jgrapht.org/javadoc-1.0.0/org/jgrapht/traverse/TopologicalOrderIterator.html#TopologicalOrderIterator-org.jgrapht.DirectedGraph-java.util.Queue- 🔗 https://www.cs.fsu.edu/~lacher/lectures/Output/graphs1/slide09.html
