2b:null 2c:["$","title",null,{"children":"Tangled tree visualization | bea | Observable"}] 31:T510,intro = md`A tree with multiple inheritance (sometimes called *tangled tree*) cannot be represented by using a classic tree visualization. It is technically a directed acyclic graph (DAG) with one (or more) nodes identified as root. Using a graph visualization technique solves the issue, but poorly represents some peculiarities of a quasi-tree structure. This visualization tries to address the representation of a tangled tree (a genealogy in this specific example). The layout and basic technique is the same underlying [Geneaquilts](https://aviz.fr/Research/Geneaquilts) [[1](#footnote1)], but with curved links instead of matrices. Metro-style bundling is used when a parent node appears in multiple "families", and the layout is made more compact on the y axis. The intention is for the graphic to be more readily understood, while losing some of the advantages of Geneaquilts (e.g., representing a union without children). See also [this older, simpler example](https://beta.observablehq.com/@nitaku/tangled-tree-visualization). The technique can also be applied to other types of tangled trees. Such structures are commonly found in computational linguistics (thesauri, some ontologies, wordnets). (Thanks to [@trebor](https://observablehq.com/@trebor) for making it more reusable!)`32:T668,renderChart = (data, options={}) => { options.color ||= (d, i) => color(i) const tangleLayout = constructTangleLayout(_.cloneDeep(data), options); return svg``; }33:Tcfd,data = [ [ { "id": "BOM-VERNA-01", "displaytext": "HYUNDAI-VERNA-2025" } ], [ { "id": "ITEM-2001", "parents": [ "BOM-VERNA-01" ], "displaytext": "CHASSIS_&_SUSPENSION-HV-01" }, { "id": "ITEM-3570", "parents": [ "BOM-VERNA-01" ], "displaytext": "INTELECT-HVERNA-01" }, { "id": "ITEM-5297", "parents": [ "BOM-VERNA-01" ], "displaytext": "CHSUSP-HVERNA-01" }, { "id": "ITEM-5250", "parents": [ "BOM-VERNA-01" ], "displaytext": "INTERIOR-HVERNA-01" } ], [ { "id": "SUBITEM-3002", "parents": [ "ITEM-2001", "ITEM-3570", "ITEM-5250" ] }, { "id": "SUBITEM-5410", "parents": [ "ITEM-3570" ] }, { "id": "SUBITEM-1718", "parents": [ "ITEM-5297" ] }, { "id": "SUBITEM-8089", "parents": [ "ITEM-5250" ] }, { "id": "SUBITEM-6145", "parents": [ "ITEM-5250" ] } ], [ { "id": "PART-9015", "parents": [ "SUBITEM-3002" ], "displaytext": "subd_fan_motor" }, { "id": "PART-9016", "parents": [ "SUBITEM-3002" ], "displaytext": "subd_fan_motor001" }, { "id": "PART-9017", "parents": [ "SUBITEM-3002" ], "displaytext": "subd_fan_motor002" }, { "id": "PART-9018", "parents": [ "SUBITEM-3002" ], "displaytext": "subd_fan_motor003" }, { "id": "PART-5410", "parents": [ "SUBITEM-5410" ], "displaytext": "Speakers" }, { "id": "PART-1718", "parents": [ "SUBITEM-1718" ], "displaytext": "Electronic Power Steering (EPS) Motor" }, { "id": "PART-8089", "parents": [ "SUBITEM-8089" ], "displaytext": "Air Blower Motor" }, { "id": "PART-6145", "parents": [ "SUBITEM-6145" ], "displaytext": "Center console" } ], [ { "id": "PART-9015::Neodymium Magnet", "parents": [ "PART-9015" ], "displaytext": "Neodymium Magnet" }, { "id": "PART-9016::Neodymium Magnet", "parents": [ "PART-9016" ], "displaytext": "Neodymium Magnet" }, { "id": "PART-9017::Neodymium Magnet", "parents": [ "PART-9017" ], "displaytext": "Neodymium Magnet" }, { "id": "PART-9018::Neodymium Magnet", "parents": [ "PART-9018" ], "displaytext": "Neodymium Magnet" }, { "id": "PART-5410::Neodymium Magnet", "parents": [ "PART-5410" ], "displaytext": "Neodymium Magnet" }, { "id": "PART-1718::Neodymium Magnet", "parents": [ "PART-1718" ], "displaytext": "Neodymium Magnet" }, { "id": "PART-8089::Neodymium Magnet", "parents": [ "PART-8089" ], "displaytext": "Neodymium Magnet" }, { "id": "PART-6145::Neodymium Magnet", "parents": [ "PART-6145" ], "displaytext": "Neodymium Magnet" } ] ] 34:T1089,constructTangleLayout = (levels, options={}) => { // precompute level depth levels.forEach((l, i) => l.forEach(n => (n.level = i))); var nodes = levels.reduce((a, x) => a.concat(x), []); var nodes_index = {}; nodes.forEach(d => (nodes_index[d.id] = d)); // objectification nodes.forEach(d => { d.parents = (d.parents === undefined ? [] : d.parents).map( p => nodes_index[p] ); }); // precompute bundles levels.forEach((l, i) => { var index = {}; l.forEach(n => { if (n.parents.length == 0) { return; } var id = n.parents .map(d => d.id) .sort() .join('-X-'); if (id in index) { index[id].parents = index[id].parents.concat(n.parents); } else { index[id] = { id: id, parents: n.parents.slice(), level: i, span: i - d3.min(n.parents, p => p.level) }; } n.bundle = index[id]; }); l.bundles = Object.keys(index).map(k => index[k]); l.bundles.forEach((b, i) => (b.i = i)); }); var links = []; nodes.forEach(d => { d.parents.forEach(p => links.push({ source: d, bundle: d.bundle, target: p }) ); }); var bundles = levels.reduce((a, x) => a.concat(x.bundles), []); // reverse pointer from parent to bundles bundles.forEach(b => b.parents.forEach(p => { if (p.bundles_index === undefined) { p.bundles_index = {}; } if (!(b.id in p.bundles_index)) { p.bundles_index[b.id] = []; } p.bundles_index[b.id].push(b); }) ); nodes.forEach(n => { if (n.bundles_index !== undefined) { n.bundles = Object.keys(n.bundles_index).map(k => n.bundles_index[k]); } else { n.bundles_index = {}; n.bundles = []; } n.bundles.sort((a,b) => d3.descending(d3.max(a, d => d.span), d3.max(b, d => d.span))) n.bundles.forEach((b, i) => (b.i = i)); }); links.forEach(l => { if (l.bundle.links === undefined) { l.bundle.links = []; } l.bundle.links.push(l); }); // layout const padding = 8; const node_height = 22; const node_width = 70; const bundle_width = 14; const level_y_padding = 16; const metro_d = 4; const min_family_height = 22; options.c ||= 16; const c = options.c; options.bigc ||= node_width+c; nodes.forEach( n => (n.height = (Math.max(1, n.bundles.length) - 1) * metro_d) ); var x_offset = padding; var y_offset = padding; levels.forEach(l => { x_offset += l.bundles.length * bundle_width; y_offset += level_y_padding; l.forEach((n, i) => { n.x = n.level * node_width + x_offset; n.y = node_height + y_offset + n.height / 2; y_offset += node_height + n.height; }); }); var i = 0; levels.forEach(l => { l.bundles.forEach(b => { b.x = d3.max(b.parents, d => d.x) + node_width + (l.bundles.length - 1 - b.i) * bundle_width; b.y = i * node_height; }); i += l.length; }); links.forEach(l => { l.xt = l.target.x; l.yt = l.target.y + l.target.bundles_index[l.bundle.id].i * metro_d - (l.target.bundles.length * metro_d) / 2 + metro_d / 2; l.xb = l.bundle.x; l.yb = l.bundle.y; l.xs = l.source.x; l.ys = l.source.y; }); // compress vertical space var y_negative_offset = 0; levels.forEach(l => { y_negative_offset += -min_family_height + d3.min(l.bundles, b => d3.min(b.links, link => link.ys - 2*c - (link.yt + c)) ) || 0; l.forEach(n => (n.y -= y_negative_offset)); }); // very ugly, I know links.forEach(l => { l.yt = l.target.y + l.target.bundles_index[l.bundle.id].i * metro_d - (l.target.bundles.length * metro_d) / 2 + metro_d / 2; l.ys = l.source.y; l.c1 = l.source.level - l.target.level > 1 ? Math.min(options.bigc, l.xb-l.xt, l.yb-l.yt)-c : c; l.c2 = c; }); var layout = { width: d3.max(nodes, n => n.x) + node_width + 2 * padding, height: d3.max(nodes, n => n.y) + node_height / 2 + 2 * padding, node_height, node_width, bundle_width, level_y_padding, metro_d }; return { levels, nodes, nodes_index, links, bundles, layout }; }35:[] 2f:{"id":"d852831af02ca19d","slug":null,"title":"Tangled tree visualization","thumbnail":"bc94d35c51d164551e8cb39238f2aecb85ebff973a9f3c80d5406cf4e79d03ed","access_level":"public","create_time":"$D2025-07-12T13:24:19.555Z","update_time":"$D2025-07-12T13:25:34.698Z","view_time":null,"first_public_time":"$D2025-07-12T13:24:19.555Z","has_unpublished_edits":null,"fork":{"id":"01fdbd0e92fcc289","slug":null,"title":"Tangled tree visualization","owner":{"id":"c53942b03f59e637","login":"tangledtree2","name":"TangledTree"}},"stars":0,"starred":false,"owner":{"type":"team","id":"18aeb6daee87a192","login":"llb4ll","name":"bea","avatar_url":"https://avatars-next.observableusercontent.com/1817a622719b68c15fd89c864643a2513d5e715681d61186936e60b95a0bcc0e","tier":"starter_2024"},"version":689,"publish_version":null,"role":null,"authored":false,"authors":[{"type":"individual","id":"2e1df79eb11834a9","login":"llb4ll","name":"bea","avatar_url":"https://avatars-next.observableusercontent.com/1817a622719b68c15fd89c864643a2513d5e715681d61186936e60b95a0bcc0e","tier":null}],"members":[{"type":"individual","id":"2e1df79eb11834a9","login":"llb4ll","name":"bea","avatar_url":"https://avatars-next.observableusercontent.com/1817a622719b68c15fd89c864643a2513d5e715681d61186936e60b95a0bcc0e","tier":null,"role":"editor"}],"comments":[{"id":"63ada979ff38936e","reply_to_id":null,"content":"Nice! Would be cool, if you could add multiple inheritance in the example data to really show off the viz!","create_time":"$D2025-07-12T13:27:53.102Z","update_time":"$D2025-07-12T13:28:10.718Z","resolved":false,"user":{"type":"individual","id":"2e1df79eb11834a9","login":"llb4ll","name":"bea","avatar_url":"https://avatars-next.observableusercontent.com/1817a622719b68c15fd89c864643a2513d5e715681d61186936e60b95a0bcc0e","tier":null}}],"custom_thumbnail":false,"trashed":false,"lapsed":null,"subscribed":null,"forks":0,"collection":null,"type":"notebook","body":{"title":"Tangled tree visualization","cells":[{"id":0,"value":"md`# Tangled tree visualization`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":527,"value":"renderChart(data)","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":226,"value":"$31","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":556,"value":"md`## Code`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":6,"value":"$32","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":13,"value":"$33","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":523,"value":"$34","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":239,"value":"color = d3.scaleOrdinal(d3.schemeDark2)","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":435,"value":"background_color = 'white'","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":532,"value":"md`## Dependencies`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":242,"value":"d3 = require('d3-scale', 'd3-scale-chromatic', 'd3-array')","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":521,"value":"_ = require(\"lodash\")","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":546,"value":"import {footnote} from \"@jashkenas/markdown-style-footnotes\"","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":535,"value":"md`## References`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":539,"value":"footnote1 = footnote(\"intro\", 1, `A. Bezerianos, P. Dragicevic, J. Fekete, J. Bae and B. Watson, \"GeneaQuilts: A System for Exploring Large Genealogies,\" in IEEE Transactions on Visualization and Computer Graphics, vol. 16, no. 6, pp. 1073-1081, Nov.-Dec. 2010, doi: 10.1109/TVCG.2010.159.`)","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"}],"files":"$W35","stdlib":"1","titling":"auto"}} 30:"$2f:body"