Together with my colleagues we are coding specific tools for random generation, visualization of large trees and analytic combinatorics. My main contributions are dealing with algorithmics.
Combination Unranking
Note: this plot represents the time (in milliseconds) spent to unrank a combination of k elements among 10,000 when k ranges 0 to 10,000.
Set Partition Unranking
Arbogen
Note: this example is a plane rooted tree of more than 100.000 nodes obtained in a few seconds on a standard PC.
BDDgen
Note: this example is an ROBDD with 8 variables of size 60 obtained in a few milliseconds on a standard PC.
RandDAG
Note: this example is an ordered DAG with 1000 edges obtained in a few milliseconds on a standard PC. Each color in the nodes corresponds to a specific outdegree for that node.
TreeDisplay
Specific tools for Sagemath