Python implementation of the Yamada-Kataoka-Watanabe algorithm to find all minimum spanning trees in an undirected graph.
-
Updated
Jun 10, 2022 - Python
Python implementation of the Yamada-Kataoka-Watanabe algorithm to find all minimum spanning trees in an undirected graph.
Fluctuation theory of singular (Watanabe) learning — equations of state, the second cumulant, the trajectory law sigma^2=2*lambda, and data instruments for (lambda,nu,M,h). Every table regenerates from code.
Add a description, image, and links to the watanabe topic page so that developers can more easily learn about it.
To associate your repository with the watanabe topic, visit your repo's landing page and select "manage topics."