Skip to content

Latest commit

 

History

History
5 lines (4 loc) · 301 Bytes

File metadata and controls

5 lines (4 loc) · 301 Bytes

Generate Algorithm

Implementation of a discrete MCMC to uniformly sample Spanning Trees in graphs.

For a full review on the matter visit my personal blog, Muestreo Uniforma de árboles maximales