Loom and Graphs in Clojure
summary
Loom is a Clojure graph library that implements many algorithms (DFS/BFS, topological sort, Bellman-Ford implementation and a shortest‑path pair) using an adjacency-list representation, plus graph visualization. Examples convert SSA program blocks to Loom, export Titan/Titanium-backed graph DBs, and analyze dependency graphs from 10,000 GitHub repos (dataflow analysis runs well under a minute). Integrations shown: Titanium integration for graph databases and core.async to visualize the go state machine. It works but some algorithms require the whole graph in memory and need more performance and tests.
AI-written summary · about
chapters (15)
- 0:00Intro
- 1:12Loom Overview: Supported Graphs
- 1:41Loom Overview: Graph Algorithms * DFS/BFS (+ bidirectional)
- 3:31Loom Overview: Visualizing Graphs
- 3:57Graph API: Representations
- 6:55Graph API: Graph
- 8:41Graph API: Complex Graphs
- 11:46Bellman-Ford
- 17:57loom.alg-generic
- 19:07Your Graphs in Loom
- 19:45SSA Loom
- 24:04Titanium Loom
- 25:29Data Flow Analysis Framework
- 27:10Github: Clojure Repos + Relations
- 30:33Loom's Vision
related talks
37mLoom and Functional Graphs in Clojure
43m+ Loom years 2
27mPower to the (Mobile) People: Clojure and GraphQL
37mCascalog 2- Streaming MapReduce in Clojure
38mScientific Clojure, a bird's eye view
01h 02mSolving Problems the Clojure Way
52m"The Amazing Clojure"
19mDotloom - Next Generation Point-cloud Platform