An antidote to complexity
summary
Compares S3, S4 and reference classes and shows a concrete DAG implementation: a class-based DAG object that stores nodes in its own environment, plots hierarchically, highlights roots and leaves, and computes shortest path and critical path metrics. Heavy computations run in rcpp and visual output uses the network/D3 stack; code lives in a public repository. Demonstration shows the object layer working end-to-end: construction, plotting and path algorithms all produce expected results.
AI-written summary · about
chapters (5)
- 0:00Introduction to complexity
- 3:35Overengineering the zebra suit
- 7:46S3 S4 and reference classes
- 12:39Graphs with reference classes
- 16:33Final demo and Q&A
related talks
38mCan we visualize software complexity?
47mExploring a complex codebase with AI
13mDCR Graphs as Co-created Executable Models of the Law
38mAdding Simplicity to Complexity
29mDynamic slicing of Reaction Systems based on assertions and monitors
17mExploiting the Sparseness of Control-Flow and Call Graphs for Efficient and On-...
28mKnowledge Graph of Your IT Landscape: Code Is Graph Data
30mFrom Chaos to Domain Driven Design