2c:null 2d:["$","title",null,{"children":"Radial tidy tree | sisi's Workspace | Observable"}] 32:T849,chart = { // Specify the chart’s dimensions. const width = 2500; const height = 1.5*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 - 300; // 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: 19px 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(); }33:[{"id":"41dfbd586421d90419088c8ede2ef512bfa23f1341a8819469a55d6f53916d4b8f46f65dde90e1676b98bf5d30034296c2a79874bbc6ec40994e7874466c9a44","href":"https://static.observableusercontent.com/files/41dfbd586421d90419088c8ede2ef512bfa23f1341a8819469a55d6f53916d4b8f46f65dde90e1676b98bf5d30034296c2a79874bbc6ec40994e7874466c9a44","name":"ALFlowLyzer_updated.json","type":"application/json","lastModified":1784537687869.931,"size":17254},{"id":"a5056a0c3641f920db436dd81e397f8bc880b8288b136935e35cb83985ad56639d3bce0b3887e328368ab36764e077a4b38e57112b2e98e88484aa7d37dd6107","href":"https://static.observableusercontent.com/files/a5056a0c3641f920db436dd81e397f8bc880b8288b136935e35cb83985ad56639d3bce0b3887e328368ab36764e077a4b38e57112b2e98e88484aa7d37dd6107","name":"NTLFlowLyzer_Feature_Taxonomy@1.json","type":"application/json","lastModified":1784535051023.164,"size":15346},{"id":"0312295fa023871610f6dce5a773f17366ba9617517db1cb3555ad5f55f15667bb92b5a434a02776b764115623583a4111297f2656ec9e867c5ea2da7f8fa0cd","href":"https://static.observableusercontent.com/files/0312295fa023871610f6dce5a773f17366ba9617517db1cb3555ad5f55f15667bb92b5a434a02776b764115623583a4111297f2656ec9e867c5ea2da7f8fa0cd","name":"PDFMalLyzer_Feature_Taxonomy.json","type":"application/json","lastModified":1784542722586.434,"size":2827},{"id":"f882316f719cd5ab5814698415e7ba401bbeaf2694cb0285ed5be0e8cd230dd04323ed10b5a0d0a089ebb534058355f570df3b9e600ee3e51f3541c48917576a","href":"https://static.observableusercontent.com/files/f882316f719cd5ab5814698415e7ba401bbeaf2694cb0285ed5be0e8cd230dd04323ed10b5a0d0a089ebb534058355f570df3b9e600ee3e51f3541c48917576a","name":"QUICFlowLyzer_Feature_Taxonomy.json","type":"application/json","lastModified":1784534829440.839,"size":3478},{"id":"01d132c0d27f8921fb7e158e4db19ffe552d15851b4dfda3ced3db306cda291e7662cd1d9bd62e82ae5297d35ac61fbe5738cbeb66e7b7f1e6dbb83a2aedbc89","href":"https://static.observableusercontent.com/files/01d132c0d27f8921fb7e158e4db19ffe552d15851b4dfda3ced3db306cda291e7662cd1d9bd62e82ae5297d35ac61fbe5738cbeb66e7b7f1e6dbb83a2aedbc89","name":"UDPFlowLyzer_Feature_Taxonomy@1.json","type":"application/json","lastModified":1784534800557.918,"size":45512},{"id":"4df937437e5085a50d0e5715f77fafe8ae5ae0e50c424fbcb1148bcdb763d81dc72060262784eb3d99cd33652f676ca019aba28b5590688fb0b015a418a0b438","href":"https://static.observableusercontent.com/files/4df937437e5085a50d0e5715f77fafe8ae5ae0e50c424fbcb1148bcdb763d81dc72060262784eb3d99cd33652f676ca019aba28b5590688fb0b015a418a0b438","name":"User-Profile.json","type":"application/json","lastModified":1784542481715.598,"size":1932},{"id":"2042dd1245b173e9d996cb53905efc5811df587da5bc568f8f3354b5cf04877596beb20dc1a82e54fe9e5fe2c3f62592d649e2311f80754d46c424d49aa9397f","href":"https://static.observableusercontent.com/files/2042dd1245b173e9d996cb53905efc5811df587da5bc568f8f3354b5cf04877596beb20dc1a82e54fe9e5fe2c3f62592d649e2311f80754d46c424d49aa9397f","name":"VolMemLyzer_updated.json","type":"application/json","lastModified":1784542072654.586,"size":60108},{"id":"a5056a0c3641f920db436dd81e397f8bc880b8288b136935e35cb83985ad56639d3bce0b3887e328368ab36764e077a4b38e57112b2e98e88484aa7d37dd6107","href":"https://static.observableusercontent.com/files/a5056a0c3641f920db436dd81e397f8bc880b8288b136935e35cb83985ad56639d3bce0b3887e328368ab36764e077a4b38e57112b2e98e88484aa7d37dd6107","name":"NTLFlowLyzer_Feature_Taxonomy@2.json","type":"application/json","lastModified":1784535443435.57,"size":15346},{"id":"a5056a0c3641f920db436dd81e397f8bc880b8288b136935e35cb83985ad56639d3bce0b3887e328368ab36764e077a4b38e57112b2e98e88484aa7d37dd6107","href":"https://static.observableusercontent.com/files/a5056a0c3641f920db436dd81e397f8bc880b8288b136935e35cb83985ad56639d3bce0b3887e328368ab36764e077a4b38e57112b2e98e88484aa7d37dd6107","name":"NTLFlowLyzer_Feature_Taxonomy.json","type":"application/json","lastModified":1784534800557.918,"size":15346},{"id":"2b8e6cf611891729bf0e8d2df6218f84fe3b0a3af995d8aeb5102400fad08dcd217cf0c93f2033722897b27b84dd91523b4677f3503b03cb3401e669d00e479a","href":"https://static.observableusercontent.com/files/2b8e6cf611891729bf0e8d2df6218f84fe3b0a3af995d8aeb5102400fad08dcd217cf0c93f2033722897b27b84dd91523b4677f3503b03cb3401e669d00e479a","name":"NTLFlowLyzer_updated.json","type":"application/json","lastModified":1784535926861.382,"size":38520}] 30:{"id":"afc9b07a460a5e9a","slug":"radial-tidy-tree","title":"Radial tidy tree","thumbnail":"bc3ed10430ca7c6c5d53c50a602d1baa90b1745986d0361f414f3ab372a069f2","access_level":"public","create_time":"$D2026-10-04T14:56:16.830Z","update_time":"$D2026-10-04T15:00:57.026Z","view_time":null,"first_public_time":"$D2026-10-04T14:56:32.902Z","has_unpublished_edits":null,"fork":true,"stars":0,"starred":false,"owner":{"type":"team","id":"a1be80a51e02b8c6","login":"sisi-ws","name":"sisi's Workspace","avatar_url":"https://avatars-next.observableusercontent.com/09c1de72b01957d99f2ed5e5a9d9d1457a9957e8b28f31190718bc683a5a5986","tier":"starter_2024"},"version":325,"publish_version":325,"role":null,"authored":false,"authors":[{"type":"individual","id":"4035b5b9c26b2ab7","login":"sisi","name":"sisi","avatar_url":"https://avatars-next.observableusercontent.com/200e0949262d708ddb23a3658b5e31dc00d56c5f4bb3d0ddf27b148972128d17","tier":null}],"members":[{"type":"team","id":"a1be80a51e02b8c6","login":"sisi-ws","name":"sisi's Workspace","avatar_url":"https://avatars-next.observableusercontent.com/09c1de72b01957d99f2ed5e5a9d9d1457a9957e8b28f31190718bc683a5a5986","tier":"starter_2024","role":"editor"}],"comments":[],"custom_thumbnail":false,"trashed":false,"lapsed":null,"subscribed":null,"forks":0,"collection":null,"type":"notebook","body":{"titling":"auto","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","providerMetadata":"$undefined","attachments":"$undefined","output":"","database":"$undefined"},{"id":10,"value":"$32","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"$undefined","database":"$undefined"},{"id":299,"value":"data = FileAttachment(\"PDFMalLyzer_Feature_Taxonomy.json\").json()","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"$undefined","database":"$undefined"}],"files":"$W33","stdlib":"1"}} 31:"$30:body"