[ Launch: sankey-test-1 ] 2446e1dc3bc789e7a4ca25872f621bd6 by whitelynx
[ Launch: diagonal-test-1 ] 1217283ecbd2093073d4 by jdutta
[ Launch: quick-chart-vert ] 2c8553335067321f44a4 by jdutta
[ Launch: quick-chart-1 ] 99181b7e0eb393be4380 by jdutta
[ Launch: scratchpad ] 9721189 by jdutta
-
-
Save whitelynx/2446e1dc3bc789e7a4ca25872f621bd6 to your computer and use it in GitHub Desktop.
sankey-test-1
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
{"description":"sankey-test-1","endpoint":"","display":"svg","public":true,"require":[],"fileconfigs":{"inlet.js":{"default":true,"vim":false,"emacs":false,"fontSize":12},"_.md":{"default":true,"vim":false,"emacs":false,"fontSize":12},"config.json":{"default":true,"vim":false,"emacs":false,"fontSize":12},"s_action.csv":{"default":true,"vim":false,"emacs":false,"fontSize":12},"inlet.css":{"default":true,"vim":false,"emacs":false,"fontSize":12},"c_ip.csv":{"default":true,"vim":false,"emacs":false,"fontSize":12},"chart_data.csv":{"default":true,"vim":false,"emacs":false,"fontSize":12},"sankey.js":{"default":true,"vim":false,"emacs":false,"fontSize":12},"main.css":{"default":true,"vim":false,"emacs":false,"fontSize":12},"data1.json":{"default":true,"vim":false,"emacs":false,"fontSize":12},"data2.json":{"default":true,"vim":false,"emacs":false,"fontSize":12}},"fullscreen":false,"play":false,"loop":false,"restart":false,"autoinit":true,"pause":true,"loop_type":"pingpong","bv":false,"nclones":15,"clone_opacity":0.4,"duration":3000,"ease":"linear","dt":0.01,"ajax-caching":true,"thumbnail":"http://i.imgur.com/1im8jwg.gif"} |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
{ | |
"nodes": [ | |
{"name": "Public"}, | |
{"name": "Internal"}, | |
{"name": "External"}, | |
{"name": "Risk-PCI"}, | |
{"name": "Risk-PII"}, | |
{"name": "Risk-SourceCode"}, | |
{"name": "Risk-Other"}, | |
{"name": "Type-Executable"}, | |
{"name": "Type-Health"}, | |
{"name": "Type-Other"}, | |
{"name": "total"} | |
], | |
"links": [ | |
{"source": 0, "target": 3, "value": 4}, | |
{"source": 0, "target": 4, "value": 5}, | |
{"source": 0, "target": 5, "value": 1}, | |
{"source": 0, "target": 6, "value": 3}, | |
{"source": 1, "target": 3, "value": 1}, | |
{"source": 1, "target": 4, "value": 2}, | |
{"source": 1, "target": 5, "value": 4}, | |
{"source": 1, "target": 6, "value": 2}, | |
{"source": 2, "target": 3, "value": 1}, | |
{"source": 2, "target": 4, "value": 2}, | |
{"source": 2, "target": 6, "value": 1}, | |
{"source": 3, "target": 7, "value": 3}, | |
{"source": 3, "target": 9, "value": 5}, | |
{"source": 4, "target": 7, "value": 5}, | |
{"source": 5, "target": 7, "value": 2}, | |
{"source": 5, "target": 8, "value": 4}, | |
{"source": 6, "target": 8, "value": 6}, | |
{"source": 6, "target": 9, "value": 2}, | |
{"source": 7, "target": 10, "value": 10}, | |
{"source": 8, "target": 10, "value": 10}, | |
{"source": 9, "target": 10, "value": 7} | |
] | |
} |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
{ | |
"nodes": [ | |
{"name": "GoogleDrive"}, | |
{"name": "Dropbox"}, | |
{"name": "Box"}, | |
{"name": "Exposed"}, | |
{"name": "PCI"}, | |
{"name": "HIPAA"}, | |
{"name": "PII"} | |
], | |
"links": [ | |
{"source": 0, "target": 3, "value": 478}, | |
{"source": 0, "target": 4, "value": 228}, | |
{"source": 0, "target": 5, "value": 25}, | |
{"source": 0, "target": 6, "value": 238}, | |
{"source": 1, "target": 3, "value": 133}, | |
{"source": 1, "target": 4, "value": 28}, | |
{"source": 1, "target": 5, "value": 11}, | |
{"source": 1, "target": 6, "value": 12}, | |
{"source": 2, "target": 3, "value": 51}, | |
{"source": 2, "target": 4, "value": 2}, | |
{"source": 2, "target": 5, "value": 2}, | |
{"source": 2, "target": 6, "value": 1} | |
] | |
} |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
// Testing of d3.sankey | |
// Configurable params | |
// Click on the number and see a magic slider appears to tweak it. | |
var config = { | |
width: 700, | |
height: 382 | |
}; | |
var data = tributary.data1; | |
//var data = tributary.data2; | |
var getUid = (function () { | |
var counter = 0; | |
return function() { | |
return 'uid-' + counter++; | |
} | |
})(); | |
function assignUid(data) { | |
data.nodes.forEach(function (d) { | |
d.uid = getUid(); | |
}); | |
data.links.forEach(function (d) { | |
d.uid = getUid(); | |
}); | |
return data; | |
} | |
console.log(data) | |
visualize(assignUid(data)); | |
function visualize(data) { | |
var svg = d3.select('svg'); | |
var gRoot = svg.append('svg:g') | |
.attr('transform', 'translate(5, 90)'); | |
var color = d3.scale.category20(); | |
// Set the sankey diagram properties | |
var sankey = d3.sankey() | |
.nodeWidth(96) | |
.nodePadding(91) | |
.size([config.width, config.height]) | |
.nodes(data.nodes) | |
.links(data.links) | |
.layout(32); | |
var path = sankey.link(); // path function | |
var link = gRoot.selectAll(".link") | |
.data(data.links) | |
.enter().append("path") | |
.attr("class", "link") | |
.attr('id', function (d) { return d.uid; }) | |
.attr("d", path) | |
//.style('fill', 'none').style('stroke', '#000').style('stroke-opacity', 0.2) | |
.style("stroke-width", function(d) { return Math.max(1, d.dy); }) | |
.sort(function(a, b) { return b.dy - a.dy; }); | |
link.append("title") | |
.text(function(d) { | |
return d.source.name + " → " + d.target.name + "\n" + d.value; | |
}); | |
var node = gRoot.selectAll(".node") | |
.data(data.nodes) | |
.enter().append("g") | |
.attr("class", "node") | |
.attr("transform", function(d) { | |
return "translate(" + d.x + "," + d.y + ")"; }) | |
.call(d3.behavior.drag() | |
.origin(function(d) { return d; }) | |
.on("dragstart", function() { | |
this.parentNode.appendChild(this); }) | |
.on("drag", dragmove)); | |
node.append("rect") | |
.attr("height", sankey.nodeWidth())//function(d) { return d.dy; }) | |
.attr("width", sankey.nodeWidth()) | |
.style("fill", function(d) { | |
return d.color = color(d.name); }) | |
.style("stroke", function(d) { | |
return d3.rgb(d.color).darker(2); }) | |
.append("title") | |
.text(function(d) { return d.name + "\n" + d.value; }); | |
node.append("text") | |
.attr("x", sankey.nodeWidth() / 2) | |
.attr("y", function(d) { return sankey.nodeWidth() / 2; }) | |
.attr("dy", ".15em") | |
.attr("text-anchor", "middle") | |
.attr("transform", null) | |
.text(function(d) { return d.name; }) | |
node.on('mouseover', function (d) { | |
console.log(d); | |
d3.selectAll('.link').classed('active', false); | |
d.sourceLinks.forEach(function (x) { | |
d3.select('#' + x.uid).classed('active', true); | |
}) | |
d.targetLinks.forEach(function (x) { | |
d3.select('#' + x.uid).classed('active', true); | |
}) | |
}); | |
node.on('mouseout', function (d) { | |
d3.selectAll('.link').classed('active', false); | |
}); | |
function dragmove(d) { | |
var newX = Math.max(0, Math.min(config.width - d.dx, d3.event.x)); | |
var newY = Math.max(0, Math.min(config.height - d.dy, d3.event.y)); | |
d3.select(this).attr("transform", | |
"translate(" + (d.x /*= newX*/) + "," + (d.y = newY) + ")"); | |
sankey.relayout(); | |
link.attr("d", path); | |
} | |
} | |
d3.selection.prototype.moveToFront = function() { | |
return this.each(function() { | |
this.parentNode.appendChild(this); | |
}); | |
}; |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
.node rect { | |
cursor: move; | |
fill-opacity: .9; | |
shape-rendering: crispEdges; | |
} | |
.node text { | |
font-size: 12px; | |
pointer-events: none; | |
text-shadow: 0 1px 0 #fff; | |
} | |
.link { | |
fill: none; | |
stroke: #000; | |
stroke-opacity: 0.1; | |
} | |
.link.active { | |
stroke-opacity: 0.5; | |
} | |
.link:hover { | |
stroke-opacity: 0.3; | |
} |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
d3.sankey = function() { | |
var sankey = {}, | |
nodeWidth = 24, | |
nodePadding = 8, | |
size = [1, 1], | |
nodes = [], | |
links = []; | |
sankey.nodeWidth = function(_) { | |
if (!arguments.length) return nodeWidth; | |
nodeWidth = +_; | |
return sankey; | |
}; | |
sankey.nodePadding = function(_) { | |
if (!arguments.length) return nodePadding; | |
nodePadding = +_; | |
return sankey; | |
}; | |
sankey.nodes = function(_) { | |
if (!arguments.length) return nodes; | |
nodes = _; | |
return sankey; | |
}; | |
sankey.links = function(_) { | |
if (!arguments.length) return links; | |
links = _; | |
return sankey; | |
}; | |
sankey.size = function(_) { | |
if (!arguments.length) return size; | |
size = _; | |
return sankey; | |
}; | |
sankey.layout = function(iterations) { | |
computeNodeLinks(); | |
computeNodeValues(); | |
computeNodeBreadths(); | |
computeNodeDepths(iterations); | |
computeLinkDepths(); | |
return sankey; | |
}; | |
sankey.relayout = function() { | |
computeLinkDepths(); | |
return sankey; | |
}; | |
sankey.link = function() { | |
var curvature = 0.5; | |
function link(d) { | |
var x0 = d.source.x + d.source.dx, | |
x1 = d.target.x, | |
xi = d3.interpolateNumber(x0, x1), | |
x2 = xi(curvature), | |
x3 = xi(1 - curvature), | |
y0 = d.source.y + d.sy + d.dy / 2, | |
y1 = d.target.y + d.ty + d.dy / 2; | |
return "M" + x0 + "," + y0 | |
+ "C" + x2 + "," + y0 | |
+ " " + x3 + "," + y1 | |
+ " " + x1 + "," + y1; | |
} | |
link.curvature = function(_) { | |
if (!arguments.length) return curvature; | |
curvature = +_; | |
return link; | |
}; | |
return link; | |
}; | |
// Populate the sourceLinks and targetLinks for each node. | |
// Also, if the source and target are not objects, assume they are indices. | |
function computeNodeLinks() { | |
nodes.forEach(function(node) { | |
node.sourceLinks = []; | |
node.targetLinks = []; | |
}); | |
links.forEach(function(link) { | |
var source = link.source, | |
target = link.target; | |
if (typeof source === "number") source = link.source = nodes[link.source]; | |
if (typeof target === "number") target = link.target = nodes[link.target]; | |
source.sourceLinks.push(link); | |
target.targetLinks.push(link); | |
}); | |
} | |
// Compute the value (size) of each node by summing the associated links. | |
function computeNodeValues() { | |
nodes.forEach(function(node) { | |
node.value = Math.max( | |
d3.sum(node.sourceLinks, value), | |
d3.sum(node.targetLinks, value) | |
); | |
}); | |
} | |
// Iteratively assign the breadth (x-position) for each node. | |
// Nodes are assigned the maximum breadth of incoming neighbors plus one; | |
// nodes with no incoming links are assigned breadth zero, while | |
// nodes with no outgoing links are assigned the maximum breadth. | |
function computeNodeBreadths() { | |
var remainingNodes = nodes, | |
nextNodes, | |
x = 0; | |
while (remainingNodes.length) { | |
nextNodes = []; | |
remainingNodes.forEach(function(node) { | |
node.x = x; | |
node.dx = nodeWidth; | |
node.sourceLinks.forEach(function(link) { | |
nextNodes.push(link.target); | |
}); | |
}); | |
remainingNodes = nextNodes; | |
++x; | |
} | |
// | |
moveSinksRight(x); | |
scaleNodeBreadths((size[0] - nodeWidth) / (x - 1)); | |
} | |
function moveSourcesRight() { | |
nodes.forEach(function(node) { | |
if (!node.targetLinks.length) { | |
node.x = d3.min(node.sourceLinks, function(d) { return d.target.x; }) - 1; | |
} | |
}); | |
} | |
function moveSinksRight(x) { | |
nodes.forEach(function(node) { | |
if (!node.sourceLinks.length) { | |
node.x = x - 1; | |
} | |
}); | |
} | |
function scaleNodeBreadths(kx) { | |
nodes.forEach(function(node) { | |
node.x *= kx; | |
}); | |
} | |
function computeNodeDepths(iterations) { | |
var nodesByBreadth = d3.nest() | |
.key(function(d) { return d.x; }) | |
.sortKeys(d3.ascending) | |
.entries(nodes) | |
.map(function(d) { return d.values; }); | |
// | |
initializeNodeDepth(); | |
resolveCollisions(); | |
for (var alpha = 1; iterations > 0; --iterations) { | |
relaxRightToLeft(alpha *= 0.99); | |
resolveCollisions(); | |
relaxLeftToRight(alpha); | |
resolveCollisions(); | |
} | |
function initializeNodeDepth() { | |
var ky = d3.min(nodesByBreadth, function(nodes) { | |
return (size[1] - (nodes.length - 1) * nodePadding) / d3.sum(nodes, value); | |
}); | |
nodesByBreadth.forEach(function(nodes) { | |
nodes.forEach(function(node, i) { | |
node.y = i; | |
node.dy = node.value * ky; | |
}); | |
}); | |
links.forEach(function(link) { | |
link.dy = link.value * ky; | |
}); | |
} | |
function relaxLeftToRight(alpha) { | |
nodesByBreadth.forEach(function(nodes, breadth) { | |
nodes.forEach(function(node) { | |
if (node.targetLinks.length) { | |
var y = d3.sum(node.targetLinks, weightedSource) / d3.sum(node.targetLinks, value); | |
node.y += (y - center(node)) * alpha; | |
} | |
}); | |
}); | |
function weightedSource(link) { | |
return center(link.source) * link.value; | |
} | |
} | |
function relaxRightToLeft(alpha) { | |
nodesByBreadth.slice().reverse().forEach(function(nodes) { | |
nodes.forEach(function(node) { | |
if (node.sourceLinks.length) { | |
var y = d3.sum(node.sourceLinks, weightedTarget) / d3.sum(node.sourceLinks, value); | |
node.y += (y - center(node)) * alpha; | |
} | |
}); | |
}); | |
function weightedTarget(link) { | |
return center(link.target) * link.value; | |
} | |
} | |
function resolveCollisions() { | |
nodesByBreadth.forEach(function(nodes) { | |
var node, | |
dy, | |
y0 = 0, | |
n = nodes.length, | |
i; | |
// Push any overlapping nodes down. | |
nodes.sort(ascendingDepth); | |
for (i = 0; i < n; ++i) { | |
node = nodes[i]; | |
dy = y0 - node.y; | |
if (dy > 0) node.y += dy; | |
y0 = node.y + node.dy + nodePadding; | |
} | |
// If the bottommost node goes outside the bounds, push it back up. | |
dy = y0 - nodePadding - size[1]; | |
if (dy > 0) { | |
y0 = node.y -= dy; | |
// Push any overlapping nodes back up. | |
for (i = n - 2; i >= 0; --i) { | |
node = nodes[i]; | |
dy = node.y + node.dy + nodePadding - y0; | |
if (dy > 0) node.y -= dy; | |
y0 = node.y; | |
} | |
} | |
}); | |
} | |
function ascendingDepth(a, b) { | |
return a.y - b.y; | |
} | |
} | |
function computeLinkDepths() { | |
nodes.forEach(function(node) { | |
node.sourceLinks.sort(ascendingTargetDepth); | |
node.targetLinks.sort(ascendingSourceDepth); | |
}); | |
nodes.forEach(function(node) { | |
var sy = 0, ty = 0; | |
node.sourceLinks.forEach(function(link) { | |
link.sy = sy; | |
sy += link.dy; | |
}); | |
node.targetLinks.forEach(function(link) { | |
link.ty = ty; | |
ty += link.dy; | |
}); | |
}); | |
function ascendingSourceDepth(a, b) { | |
return a.source.y - b.source.y; | |
} | |
function ascendingTargetDepth(a, b) { | |
return a.target.y - b.target.y; | |
} | |
} | |
function center(node) { | |
return node.y + node.dy / 2; | |
} | |
function value(link) { | |
return link.value; | |
} | |
return sankey; | |
}; |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment