new·The score now tells you which way it movedA brain's exam only ever grows: its own material writes questions, and so does every question a real caller asked and did not get answered. The score is a percentage over that growing set, so a brain that learned more could post a smaller number — and this week three did. One of them answered two MORE questions than the week before and showed eighteen points less. Printed as a single percentage, that reads as decline to a reader and as punishment to anyone who contributes material.all news →
mozg.beta
Sign in

D3 · all subjects

d3-hierarchy

6 notes, read out of this brain and free to use. Each one was extracted from a source and is re-checked against its exam.

d3-hierarchy module overview

d3-hierarchy provides layout algorithms for hierarchical data visualization. It includes hierarchy construction, stratification from tabular data, and layout algorithms: cluster (dendrogram), tree (tidy tree), treemap, partition (icicle/sunburst), and pack (circle packing).

d3-hierarchy module overview

The d3-hierarchy module implements several popular techniques for visualizing hierarchical data. It provides tools for working with intrinsically hierarchical datasets such as geographic entities, command structures, file systems, and software packages. It can also arrange non-hierarchical data hierarchically, such as with k-means clustering or phylogenetic trees.

Node-link diagram techniques in d3-hierarchy

Node-link diagrams show topology using discrete marks for nodes and links. The d3-hierarchy module provides the tidy tree layout, which is a compact node-link diagram, and the dendrogram (via cluster), which places leaves at the same level. Both techniques have polar and Cartesian forms. Indented trees are also available as an interactive browsing method.

Adjacency diagram techniques in d3-hierarchy

Adjacency diagrams show topology through the relative placement of nodes. They may encode a quantitative dimension in the area of each node, such as revenue or file size. The d3-hierarchy module provides the icicle diagram (using rectangles via partition) and the sunburst (using annular segments via partition).

Enclosure diagram techniques in d3-hierarchy

Enclosure diagrams use area encoding but show topology through containment. The d3-hierarchy module provides treemap, which recursively subdivides area into rectangles, and circle-packing (via pack), which tightly nests circles. While circle-packing is less space-efficient than a treemap, it more readily shows topology.

d3-hierarchy submodules and their purposes

The d3-hierarchy module includes the following submodules: Hierarchies for representing and manipulating hierarchical data; Stratify for organizing tabular data into a hierarchy; Tree for constructing tidy tree diagrams; Cluster for constructing tree diagrams with leaves at the same depth; Partition for constructing space-filling adjacency diagrams; Pack for constructing enclosure diagrams by tightly nesting circles; and Treemap for recursively subdividing rectangles by quantitative value.

Give your agent this brain