[ Launch: Tributary inlet ] 5098103 by hemulin
-
-
Save hemulin/5098103 to your computer and use it in GitHub Desktop.
Tributary inlet
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":"Tributary inlet","endpoint":"","display":"svg","public":true,"require":[],"fileconfigs":{"inlet.js":{"default":true,"vim":false,"emacs":false,"fontSize":12},"data.css":{"default":true,"vim":false,"emacs":false,"fontSize":12}},"fullscreen":false,"play":false,"loop":false,"restart":false,"autoinit":true,"pause":true,"loop_type":"period","bv":false,"nclones":15,"clone_opacity":0.4,"duration":3000,"ease":"linear","dt":0.01} |
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 { | |
stroke: #fff; | |
stroke-width: 2px; | |
} | |
.link { | |
fill: none; | |
stroke: #000; | |
} |
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
var width = 960, | |
height = 500; | |
var tree = d3.layout.tree() | |
.size([width - 20, height - 20]); | |
var root = {}, | |
nodes = tree(root); | |
root.parent = root; | |
root.px = root.x; | |
root.py = root.y; | |
var diagonal = d3.svg.diagonal(); | |
var svg = d3.select("svg").append("svg") | |
.attr("width", width) | |
.attr("height", height) | |
.append("g") | |
.attr("transform", "translate(10,10)"); | |
var node = svg.selectAll(".node"), | |
link = svg.selectAll(".link"); | |
var duration = 250, | |
timer = setInterval(update, duration); | |
function update() { | |
if (nodes.length >= 500) return clearInterval(timer); | |
// Add a new node to a random parent. | |
var n = {id: nodes.length}, | |
p = nodes[Math.random() * nodes.length | 0]; | |
if (p.children) p.children.push(n); else p.children = [n]; | |
nodes.push(n); | |
// Recompute the layout and data join. | |
node = node.data(tree.nodes(root), function(d) { return d.id; }); | |
link = link.data(tree.links(nodes), function(d) { return d.source.id + "-" + d.target.id; }); | |
// Add entering nodes in the parent’s old position. | |
node.enter().append("circle") | |
.attr("class", "node") | |
.attr("r", 4) | |
.attr("cx", function(d) { return d.parent.px; }) | |
.attr("cy", function(d) { return d.parent.py; }); | |
// Add entering links in the parent’s old position. | |
link.enter().insert("path", ".node") | |
.attr("class", "link") | |
.attr("d", function(d) { | |
var o = {x: d.source.px, y: d.source.py}; | |
return diagonal({source: o, target: o}); | |
}); | |
// Transition nodes and links to their new positions. | |
var t = svg.transition() | |
.duration(duration); | |
t.selectAll(".link") | |
.attr("d", diagonal); | |
t.selectAll(".node") | |
.attr("cx", function(d) { return d.px = d.x; }) | |
.attr("cy", function(d) { return d.py = d.y; }); | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment