View Code? Open in Web Editor
NEW
Visualizing purely functional data structures in OCaml
License: GNU General Public License v3.0
Makefile 0.43%
OCaml 99.57%
olirvu's Introduction
- Oḷirvu
- To run the app
- Visualizations
- Heaps
- Dynamic Programming
- Quantization
- Known Issues
-
Red Black Tree
-
Leftist Heap
-
Binomial Heap
-
Coin change
- If the Tree is not rendered with a default tree, the
layout hides the label of the root node. So, we always start the
visualization with some defaults
- Binomial heap viz - The children of heap are not displayed in
increasing order of rank.
- Binomial heap viz - Multiple roots problem was avoided by
introducing a root node called "heap"
olirvu's People
Contributors
Stargazers