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.
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> | |
<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> |
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> | |
svg { | |
float: left; | |
border-bottom: solid 1px #ccc; | |
border-right: solid 1px #ccc; | |
margin-right: -1px; | |
margin-bottom: -1px; |
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
module Redmine | |
class Issue | |
include Her::Model | |
end | |
class ParseXML < Faraday::Response::Middleware | |
# Parse the response body | |
# | |
# @param [String] body The response body | |
# @return [Mixed] the parsed response |
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> | |
<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; |
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
[ | |
{ | |
"result": 10, | |
"finished_at": "2011-12-01" }, | |
{ | |
"result": 20, | |
"finished_at": "2011-12-03" }, | |
{ | |
"result": 30, | |
"finished_at": "2011-12-05" }, |
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> | |
<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> |
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
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 |
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> | |
circle { | |
stroke: #fff; | |
} | |
</style> | |
<body> |
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.
OlderNewer