Tidy Tree
A tidy tree visualization displays the Flare class hierarchy as layered nodes and links, using a horizontal layout where depth is determined by distance from the root. The code implements the Reingold-Tilford algorithm via `d3.tree` and `d3.stratify`, rendering with SVG paths and circles. Interactive text labels identify each class, while internal nodes are visually distinguished by darker fill. The data comes from a CSV file, and the visualization uses `d3.linkHorizontal` to draw curved connecting links.
AI-generated descriptionThe d3.tree layout implements the Reingold-Tilford algorithm for efficient, tidy arrangement of layered nodes. The depth of nodes is computed by distance from the root, leading to a ragged appearance. Radial orientations are also supported. Implementation based on work by Jeff Heer and Jason Davies using Buchheim et al.’s linear-time variant of the Reingold-Tilford algorithm. Data shows the Flare class hierarchy, also courtesy Jeff Heer.
Compare to this radial layout.