Titanic data of Crew Class survival. Red=Not Survived and Blue=Survived. Built with blockbuilder.org
Last active
March 3, 2017 13:56
-
-
Save justlebeau/be105fc97dbc0c5abe0083296148b235 to your computer and use it in GitHub Desktop.
Titanic Survival Bubble Clusters
This file contains 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
license: mit |
This file contains 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
<!DOCTYPE html> | |
<meta charset="utf-8"> | |
<style type="text/css"> | |
text { | |
font: 10px sans-serif; | |
} | |
circle { | |
stroke: #565352; | |
stroke-width: 1; | |
} | |
</style> | |
<body> | |
<script src="https://d3js.org/d3.v3.min.js"></script> | |
<script> | |
var width = 960, | |
height = 500, | |
padding = 1.5, // separation between same-color nodes | |
clusterPadding = 6, // separation between different-color nodes | |
maxRadius = 12; | |
var color = d3.scale.ordinal() | |
.range(["#E4002B","#7A99AC"]); | |
d3.text("Titanic_v4.csv", function(error, text) { | |
if (error) throw error; | |
var colNames = "text,size,group\n" + text; | |
var data = d3.csv.parse(colNames); | |
data.forEach(function(d) { | |
d.size = +d.size; | |
}); | |
//unique cluster/group id's | |
var cs = []; | |
data.forEach(function(d){ | |
if(!cs.contains(d.group)) { | |
cs.push(d.group); | |
} | |
}); | |
var n = data.length, // total number of nodes | |
m = cs.length; // number of distinct clusters | |
//create clusters and nodes | |
var clusters = new Array(m); | |
var nodes = []; | |
for (var i = 0; i<n; i++){ | |
nodes.push(create_nodes(data,i)); | |
} | |
var force = d3.layout.force() | |
.nodes(nodes) | |
.size([width, height]) | |
.gravity(.02) | |
.charge(0) | |
.on("tick", tick) | |
.start(); | |
var svg = d3.select("body").append("svg") | |
.attr("width", width) | |
.attr("height", height); | |
var node = svg.selectAll("circle") | |
.data(nodes) | |
.enter().append("g").call(force.drag); | |
node.append("circle") | |
.style("fill", function (d) { | |
return color(d.cluster); | |
}) | |
.attr("r", function(d){return d.radius}) | |
node.append("text") | |
.attr("dy", ".3em") | |
.style("text-anchor", "middle") | |
.text(function(d) { return d.text.substring(0, d.radius / 3); }); | |
function create_nodes(data,node_counter) { | |
var i = cs.indexOf(data[node_counter].group), | |
r = Math.sqrt((i + 1) / m * -Math.log(Math.random())) * maxRadius, | |
d = { | |
cluster: i, | |
radius: data[node_counter].size*1.5, | |
text: data[node_counter].text, | |
x: Math.cos(i / m * 2 * Math.PI) * 200 + width / 2 + Math.random(), | |
y: Math.sin(i / m * 2 * Math.PI) * 200 + height / 2 + Math.random() | |
}; | |
if (!clusters[i] || (r > clusters[i].radius)) clusters[i] = d; | |
return d; | |
}; | |
function tick(e) { | |
node.each(cluster(10 * e.alpha * e.alpha)) | |
.each(collide(.5)) | |
.attr("transform", function (d) { | |
var k = "translate(" + d.x + "," + d.y + ")"; | |
return k; | |
}) | |
} | |
// Move d to be adjacent to the cluster node. | |
function cluster(alpha) { | |
return function (d) { | |
var cluster = clusters[d.cluster]; | |
if (cluster === d) return; | |
var x = d.x - cluster.x, | |
y = d.y - cluster.y, | |
l = Math.sqrt(x * x + y * y), | |
r = d.radius + cluster.radius; | |
if (l != r) { | |
l = (l - r) / l * alpha; | |
d.x -= x *= l; | |
d.y -= y *= l; | |
cluster.x += x; | |
cluster.y += y; | |
} | |
}; | |
} | |
// Resolves collisions between d and all other circles. | |
function collide(alpha) { | |
var quadtree = d3.geom.quadtree(nodes); | |
return function (d) { | |
var r = d.radius + maxRadius + Math.max(padding, clusterPadding), | |
nx1 = d.x - r, | |
nx2 = d.x + r, | |
ny1 = d.y - r, | |
ny2 = d.y + r; | |
quadtree.visit(function (quad, x1, y1, x2, y2) { | |
if (quad.point && (quad.point !== d)) { | |
var x = d.x - quad.point.x, | |
y = d.y - quad.point.y, | |
l = Math.sqrt(x * x + y * y), | |
r = d.radius + quad.point.radius + (d.cluster === quad.point.cluster ? padding : clusterPadding); | |
if (l < r) { | |
l = (l - r) / l * alpha; | |
d.x -= x *= l; | |
d.y -= y *= l; | |
quad.point.x += x; | |
quad.point.y += y; | |
} | |
} | |
return x1 > nx2 || x2 < nx1 || y1 > ny2 || y2 < ny1; | |
}); | |
}; | |
} | |
}); | |
Array.prototype.contains = function(v) { | |
for(var i = 0; i < this.length; i++) { | |
if(this[i] === v) return true; | |
} | |
return false; | |
}; | |
</script><!DOCTYPE html> | |
<head> | |
<meta charset="utf-8"> | |
<script src="https://d3js.org/d3.v4.min.js"></script> | |
<style> | |
body { margin:0;position:fixed;top:0;right:0;bottom:0;left:0; } | |
</style> | |
</head> | |
<body> | |
<script> | |
// Feel free to change or delete any of the code you see in this editor! | |
var svg = d3.select("body").append("svg") | |
.attr("width", 960) | |
.attr("height", 500) | |
svg.append("text") | |
.text("Edit the code below to change me!") | |
.attr("y", 200) | |
.attr("x", 120) | |
.style("font-size", 36) | |
.style("font-family", "monospace") | |
</script> | |
</body> |
This file contains 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
1st | 6.1 | 1 | |
---|---|---|---|
2nd | 8.35 | 1 | |
3rd | 26.4 | 1 | |
Crew | 33.65 | 1 | |
1st | 10.15 | 0 | |
2nd | 5.9 | 0 | |
3rd | 8.9 | 0 | |
Crew | 10.6 | 0 |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment