+ Loom years 2
summary
Loom now ships explicit support for Apathfinding (A), bidirectional BFS, Prim’s MST, max flow and maximal cliques, plus greedy coloring and a data-flow analysis framework* that tracks value propagation through program graphs. Implementations add multigraphs, ClojureScript builds, generative testing, CI via Travis, and memory/speed wins from transients and algorithmic fixes (contributors report working sets around ten thousand nodes). API is tightened (editable graphs separated, clojure.contrib removed) and a priority-map dependency is chosen to avoid reimplementing core data structures.
AI-written summary · about
chapters (8)
- 0:00Loom introduction
- 2:06Talk structure
- 3:07Graphs and real-world uses
- 10:20Loom in Clojure
- 13:30Loom evolution past two years
- 23:03Maintaining Loom
- 32:57Loom's vision and future
- 33:38Q&A
