Skip to content

Instantly share code, notes, and snippets.

View mccannf's full-sized avatar

mccannf

1 follower · 0 following
View GitHub Profile
@mccannf
mccannf / index.html
Last active August 29, 2015 14:04 — forked from mbostock/.block
<!DOCTYPE html>
<meta charset="utf-8">
<style>
svg {
float: left;
border-bottom: solid 1px #ccc;
border-right: solid 1px #ccc;
margin-right: -1px;
margin-bottom: -1px;
@mccannf
mccannf / index.html
Last active August 29, 2015 14:03 — forked from ilyabo/index.html
<!DOCTYPE html>
<html>
<head>
<script type="text/javascript" src="http://mbostock.github.com/d3/d3.js"></script>
<script type="text/javascript" src="http://code.jquery.com/jquery-1.7.2.min.js"></script>
<script type="text/javascript" src="jquery.tipsy.js"></script>
<link href="tipsy.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="chart"></div>
@mccannf
mccannf / README.md
Created May 17, 2013 20:12 — forked from mbostock/.block

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.