random-trees

KO | EN

gitlite — search

#javascript #hacktoberfest #typescript #llm #go #android #machine-learning #rust #java #awesome #awesome-list #security #mcp #open-source

(★ 15)

Generate random critical Galton-Watson trees and display their free trees in a force-directed layout

random-trees Latest Version Download

Download Latest Version (.zip)

// repository documentation

Was this content helpful?

★ 0 (0 ratings)

# Random Trees
Generate random critical Bienaymé (Galton-Watson) trees and display their free trees in a force-directed layout. [Visit the page](https://abrandenberger.github.io/random-trees/)!

![sample tree](https://raw.githubusercontent.com/abrandenberger/random-trees/master/sampletree.png)
Displaying the free trees: 
- The free tree structure is animated via a hand-coded model with spring and repulsive forces. 
- Displayed beside each node is its *multiplicity*, i.e., the number of nodes in the free tree that look identical to it. *The notion is more formally defined in the text.*

Tree generation: 
- The user has a choice of *offspring distribution* between various binomial distributions, the geometric distribution and the Poisson distribution. 
- `New Tree` generates a Bienaymé tree with the selected offspring distribution (with limited size to avoid computational and visual overload) 
- `Big Tree` also generates such a tree, but conditioned to have large size! 
- You can draw your own tree using `Draw Tree`; the multiplicities of each node will be shown and updated as the tree is drawn. It will be animated once `Done` is clicked.

random-trees

random-trees Latest Version Download

Today's picks

Was this content helpful?

Recent Feedback

random-trees

random-trees Latest Version Download

Today's picks

Was this content helpful?

Recent Feedback

Download README