Emmanuel Paradis An efficient algorithm to find all minimum spanning trees. 2025 13 J. Complex Networks 4 https://doi.org/10.1093/comnet/cnaf004 db/journals/compnet/compnet13.html#Paradis25 streams/journals/compnet