Commit 5b882c420adc8f0556a0d966a641aef4c812079e
2021-10-06T11:12:32
[repacker] performance optimizations for topological sorting. - Presize the output sorted graph and write it once in the correct order to avoid needing to reverse. - Swap the old/new graph vectors instead of copying. - Use a boolean vector for tracking visited instead of a set.