zuvor

simple and reasonably fast implementation of directed acyclic graphs and sets with focus on finding the fastest execution order of interdependent tasks

rank-compare-approximations

Compare two functions with respect to their ranking/sorting accuracy on an input set