rooted-trees
Playing with Runge-Kutta methods and SageMath
Algebraic manipulation of rooted trees for the analysis of B-series and Runge-Kutta schemes.
This package (non-exactly) maximizes the total prize with a budget constraint for an undirected node-weighted rooted graph loosely inspired by Bateni 2018 algorithm from DOI:10.1137/15M102695X
