26:null 27:["$","title",null,{"children":"Radial tidy tree | D3 | Observable"}] 2c:T843,chart = { // Specify the chart’s dimensions. const width = 928; const height = width; const cx = width * 0.5; // adjust as needed to fit const cy = height * 0.59; // adjust as needed to fit const radius = Math.min(width, height) / 2 - 30; // Create a radial tree layout. The layout’s first dimension (x) // is the angle, while the second (y) is the radius. const tree = d3.tree() .size([2 * Math.PI, radius]) .separation((a, b) => (a.parent == b.parent ? 1 : 2) / a.depth); // Sort the tree and apply the layout. const root = tree(d3.hierarchy(data) .sort((a, b) => d3.ascending(a.data.name, b.data.name))); // Creates the SVG container. const svg = d3.create("svg") .attr("width", width) .attr("height", height) .attr("viewBox", [-cx, -cy, width, height]) .attr("style", "width: 100%; height: auto; font: 10px sans-serif;"); // Append links. svg.append("g") .attr("fill", "none") .attr("stroke", "#555") .attr("stroke-opacity", 0.4) .attr("stroke-width", 1.5) .selectAll() .data(root.links()) .join("path") .attr("d", d3.linkRadial() .angle(d => d.x) .radius(d => d.y)); // Append nodes. svg.append("g") .selectAll() .data(root.descendants()) .join("circle") .attr("transform", d => `rotate(${d.x * 180 / Math.PI - 90}) translate(${d.y},0)`) .attr("fill", d => d.children ? "#555" : "#999") .attr("r", 2.5); // Append labels. svg.append("g") .attr("stroke-linejoin", "round") .attr("stroke-width", 3) .selectAll() .data(root.descendants()) .join("text") .attr("transform", d => `rotate(${d.x * 180 / Math.PI - 90}) translate(${d.y},0) rotate(${d.x >= Math.PI ? 180 : 0})`) .attr("dy", "0.31em") .attr("x", d => d.x < Math.PI === !d.children ? 6 : -6) .attr("text-anchor", d => d.x < Math.PI === !d.children ? "start" : "end") .attr("paint-order", "stroke") .attr("stroke", "white") .attr("fill", "currentColor") .text(d => d.data.name); return svg.node(); }2d:[{"id":"e65374209781891f37dea1e7a6e1c5e020a3009b8aedf113b4c80942018887a1176ad4945cf14444603ff91d3da371b3b0d72419fa8d2ee0f6e815732475d5de","href":"https://static.observableusercontent.com/files/e65374209781891f37dea1e7a6e1c5e020a3009b8aedf113b4c80942018887a1176ad4945cf14444603ff91d3da371b3b0d72419fa8d2ee0f6e815732475d5de","name":"flare-2.json","type":"application/octet-stream","lastModified":1686896041398.254,"size":11634}] 2a:{"id":"95ef11a0a0bd856c","slug":"radial-tree/2","title":"Radial tidy tree","thumbnail":"446558a393c43eb4aa40babc88023e5fc829875e11a485f4fc5328780d32561c","access_level":"public","create_time":"$D2023-06-16T06:14:01.398Z","update_time":"$D2024-09-23T09:30:52.907Z","view_time":null,"first_public_time":"$D2023-06-16T06:26:59.348Z","fork":{"id":"6b2dbe02ff43d031","slug":"radial-tree-component","title":"Radial tree component","owner":{"id":"863951e3ebe4c0ae","login":"d3","name":"D3"}},"stars":31,"starred":false,"owner":{"type":"team","id":"863951e3ebe4c0ae","login":"d3","name":"D3","avatar_url":"https://avatars-next.observableusercontent.com/5af16e327a90b2873351dda8a596c0d2d3bf954f64523deefe80177c9764d0f7","tier":"pro_2024"},"version":280,"publish_version":null,"role":null,"authored":false,"authors":[],"members":[{"type":"team","id":"863951e3ebe4c0ae","login":"d3","name":"D3","avatar_url":"https://avatars-next.observableusercontent.com/5af16e327a90b2873351dda8a596c0d2d3bf954f64523deefe80177c9764d0f7","tier":"pro_2024","role":"editor"},{"type":"individual","id":"45a379fcfcb14253","login":"fil","name":"Fil","avatar_url":"https://avatars-next.observableusercontent.com/d5b1777907117a2bdf2a07eb98600d7a9beb21639fde42b9753e95c88c7731a6","tier":null,"role":"editor"}],"comments":[],"custom_thumbnail":false,"trashed":false,"subscribed":null,"forks":382,"collection":{"id":"ac3c6ed33ef3345f","slug":"d3-hierarchy","title":"d3-hierarchy","owner":{"id":"863951e3ebe4c0ae","login":"d3","name":"D3"}},"type":"notebook","body":{"title":"Radial tidy tree","cells":[{"id":1,"value":"

Radial tidy tree

D3 › Gallery

\n\n# Radial tidy tree\n\nD3’s [tree layout](https://d3js.org/d3-hierarchy/tree) implements the [Reingold–Tilford “tidy” algorithm](http://reingold.co/tidier-drawings.pdf) for constructing hierarchical node-link diagrams, improved to run in linear time by [Buchheim *et al.*](http://dirk.jivas.de/papers/buchheim02improving.pdf) Tidy trees are typically more compact than [cluster dendrograms](/@d3/radial-cluster/2), which place all leaves at the same level. See also the [Cartesian variant](/@d3/tree/2).","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined"},{"id":10,"value":"$2c","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined"},{"id":166,"value":"data = FileAttachment(\"flare-2.json\").json()","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined"}],"files":"$W2d","stdlib":"1","titling":"auto"}} 2b:"$2a:body"