category_array=["Survived", "Sex", "Age", "Class", "value"]
//Reference: https://github.com/d3/d3-hierarchy
//Reference: https://github.com/d3/d3-collection
graphTree(d3.hierarchy({
label: "Passengers",
children: d3.nest()
.key(d => d[category_array[0]])
.key(d => d[category_array[1]])
.key(d => d[category_array[2]])
.key(d => d[category_array[3]])
.entries(data)
.map(function(level_1){
return {label: level_1.key, children: level_1.values.map(function(level_2){
return {label: level_2.key, children: level_2.values.map(function(level_3){
return {label: level_3.key, children: level_3.values.map(function(level_4){
return {label: level_4.key}
})}
})}
})}
})
}), {label: d => d.data.label});
md` The tree graph needs nested data with specific information of the nodes, this includes height and depth. Have a look at the nest and hierarchy functionalities in D3. Remember to include the functionality to alter the order of the level in the tree according to the order in category_array.`
parallelSet={
const svg = d3.create("svg").attr("viewBox", [0, 0, width, height]);
//Reference: https://observablehq.com/@d3/parallel-sets
const {nodes, links} = sankey({
nodes: graph.nodes.map(d => Object.assign({}, d)),
links: graph.links.map(d => Object.assign({}, d))
});
svg.append("g")
.selectAll("rect")
.data(nodes)
.join("rect")
.attr("x", d => d.x0)
.attr("y", d => d.y0)
.attr("height", d => d.y1 - d.y0)
.attr("width", d => d.x1 - d.x0)
.append("title")
.text(d => `${d.name}\n${d.value.toLocaleString()}`);
svg.append("g")
.attr("fill", "none")
.selectAll("g")
.data(links)
.join("path")
.attr("d", d3.sankeyLinkHorizontal())
.attr("stroke", d => color(d.names[0]))
.attr("stroke-width", d => d.width)
.style("mix-blend-mode", "multiply")
.append("title")
.text(d => `${d.names.join(" → ")}\n${d.value.toLocaleString()}`);
svg.append("g")
.style("font", "10px sans-serif")
.selectAll("text")
.data(nodes)
.join("text")
.attr("x", d => d.x0 < width / 2 ? d.x1 + 6 : d.x0 - 6)
.attr("y", d => (d.y1 + d.y0) / 2)
.attr("dy", "0.35em")
.attr("text-anchor", d => d.x0 < width / 2 ? "start" : "end")
.text(d => d.name)
.append("tspan")
.attr("fill-opacity", 0.7)
.text(d => ` ${d.value.toLocaleString()}`);
return svg.node();
}
//Reference: https://observablehq.com/@d3/parallel-sets
color = d3.scaleOrdinal(["Survived"], ["lightblue"]).unknown("lightgreen")
//Reference: https://observablehq.com/@d3/parallel-sets
sankey = d3.sankey()
.nodeSort(null)
.linkSort(null)
.nodeWidth(4)
.nodePadding(20)
.extent([[0, 5], [width, height - 5]])
//Reference: https://observablehq.com/@d3/parallel-sets
graph = {
let index = -1;
const nodes = [];
const nodeByKey = new Map;
const indexByKey = new Map;
const links = [];
for (const k of keys) {
for (const d of data) {
const key = JSON.stringify([k, d[k]]);
if (nodeByKey.has(key)) continue;
const node = {name: d[k]};
nodes.push(node);
nodeByKey.set(key, node);
indexByKey.set(key, ++index);
}
}
for (let i = 1; i < keys.length; ++i) {
const a = keys[i - 1];
const b = keys[i];
const prefix = keys.slice(0, i + 1);
const linkByKey = new Map;
for (const d of data) {
const names = prefix.map(k => d[k]);
const key = JSON.stringify(names);
const value = d.value || 1;
let link = linkByKey.get(key);
if (link) { link.value += value; continue; }
link = {
source: indexByKey.get(JSON.stringify([a, d[a]])),
target: indexByKey.get(JSON.stringify([b, d[b]])),
names,
value
};
links.push(link);
linkByKey.set(key, link);
}
}
return {nodes, links};
}
keys = category_array.slice(0, -1)
md`## Apendix`
data = d3.csvParse(await FileAttachment("titanic.csv").text(), d3.autoType)
import { table } from "@tmcw/tables/2"
dx = 12
dy = 90
treeLink = d3.linkHorizontal().x(d => d.y).y(d => d.x)
tree = d3.tree().nodeSize([dx, dy])
shape2path = require("shape2path@3")
d3 = require("d3@5", "d3-sankey@0.12")
height=400
Purpose-built for displays of data
Observable is your go-to platform for exploring data and creating expressive data visualizations. Use reactive JavaScript notebooks for prototyping and a collaborative canvas for visual data exploration and dashboard creation.
