Skip to content

Instantly share code, notes, and snippets.

@mccannf
mccannf / README.markdown
Created January 17, 2012 22:36
D3 Drag Rectangle with drag handles

This is an example of the power of the D3 library and how you can use the drag behavior of D3 to control the position and shape of the SVG element.

@mccannf
mccannf / README.markdown
Last active February 25, 2020 18:56
Line chart with tipsy tooltips
@mccannf
mccannf / data.csv
Created November 1, 2012 14:58
D3 Pie charts with grid lines
age population percent
<5 2704659 67
5-13 4499890 38
14-17 2159981 91
18-24 3853788 49
25-44 14106543 71
45-64 8819342 88
=65 612463 64

This simple force-directed graph shows character co-occurence in Les Misérables. A physical simulation of charged particles and springs places related characters in closer proximity, while unrelated characters are farther apart. Layout algorithm inspired by Tim Dwyer and Thomas Jakobsen. Data based on character coappearence in Victor Hugo's Les Misérables, compiled by Donald Knuth.

@mccannf
mccannf / index.html
Last active December 17, 2015 04:09 — forked from mbostock/.block
<!DOCTYPE html>
<meta charset="utf-8">
<style>
circle {
stroke: #fff;
}
</style>
<body>
@mccannf
mccannf / index.csv
Last active December 12, 2015 02:59 — forked from anonymous/index.csv
mydate Afghan Security Forces afghaninterpolated U.S. Troops usinterpolated Other Foreign Troops otherinterpolated
November-01 0 0 1300 0 0 0
December-01 240 1 2500 0 1667 1
January-02 480 1 4067 0 3333 1
February-02 720 1 5633 0 5000 0
March-02 960 1 7200 0 5000 0
April-02 1200 1 7425 0 5000 0
May-02 1440 1 7650 0 4500 0
June-02 1680 1 7875 0 5000 0
July-02 1920 1 8100 0 4900 1
@mccannf
mccannf / README.md
Created December 1, 2012 21:31 — forked from mbostock/.block
Reingold–Tilford Tree

The tree layout implements the Reingold-Tilford algorithm for efficient, tidy arrangement of layered nodes. The depth of nodes is computed by distance from the root, leading to a ragged appearance. Cartesian orientations are also supported. Implementation based on work by Jeff Heer and Jason Davies using Buchheim et al.'s linear-time variant of the Reingold-Tilford algorithm. Data shows the Flare class hierarchy, also courtesy Jeff Heer.

<!DOCTYPE html>
<html>
<head>
<meta http-equiv="Content-Type" content="text/html;charset=utf-8">
<title>Mike Heavers - Projects</title>
<script type="text/javascript" src="http://mikeheavers.com/transfers/projects/js/d3.v2.min.js"></script>
<script type="text/javascript" src="http://mikeheavers.com/transfers/projects/js/packages.js"></script>
<link type="text/css" rel="stylesheet" href="http://mikeheavers.com/transfers/projects/css/bundle-radial.css"/>
</head>
<body>
[
{
"result": 10,
"finished_at": "2011-12-01" },
{
"result": 20,
"finished_at": "2011-12-03" },
{
"result": 30,
"finished_at": "2011-12-05" },
@mccannf
mccannf / index.html
Created November 2, 2012 09:26
Force graph with larger radii
<!DOCTYPE html>
<html>
<head>
<meta http-equiv="Content-type" content="text/html; charset=utf-8">
<title>Mobile Patent Suits</title>
<script src="http://d3js.org/d3.v3.min.js"></script>
<style type="text/css">
path.link {
fill: none;