spanning_tree_distribution(G, z)
Solves the Maximum Entropy Convex Program in the Asadpour algorithm using the approach in section 7 to build an exponential distribution of undirected spanning trees.
This algorithm ensures that the probability of any edge in a spanning tree is proportional to the sum of the probabilities of the tress containing that edge over the sum of the probabilities of all spanning trees of the graph.
The undirected support graph for the Held Karp relaxation
The output of :None:None:`held_karp_ascent()`, a scaled version of the Held-Karp solution.
The probability distribution which approximately preserves the marginal probabilities of z.
Find the asadpour exponential distribution of spanning trees.
Hover to see nodes names; edges to Self not shown, Caped at 50 nodes.
Using a canvas is more power efficient and can get hundred of nodes ; but does not allow hyperlinks; , arrows or text (beyond on hover)
SVG is more flexible but power hungry; and does not scale well to 50 + nodes.
All aboves nodes referred to, (or are referred from) current nodes; Edges from Self to other have been omitted (or all nodes would be connected to the central node "self" which is not useful). Nodes are colored by the library they belong to, and scaled with the number of references pointing them