Jason Douglas Trimeego

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.

http://bl.ocks.org/Trimeego/raw/5327125/

Click to change datasets. function

	<!DOCTYPE html>
	<meta charset="utf-8">
	<title>SANKEY Experiment</title>
	<style>

	.node rect {
	cursor: move;
	fill-opacity: .9;
	shape-rendering: crispEdges;
	}

	define ["icg/sample"], (module) ->
	"use strict"
	describe "module", ->

	it "is awesome", ->
	expect(window.something).to.be "AWESOME"

	(function() {
	define([], function() {
	return function(){
	container = ".present[data-markdown]";

	var angle, arc, arcRange, color, colorScale, defs, easing, gap, height, partition, radians, radius, shapeHeight, shapeWidth, stash, svg, textPathF, transitionSpeed, tree, updateData, width;

	tree = {
	"name": "mn",
	"label": "Maintenance",

	(function() {
	define([], function() {
	return function(){
	container = ".present[data-markdown]";

	var angle, arc, arcRange, color, colorScale, defs, easing, gap, height, partition, radians, radius, shapeHeight, shapeWidth, stash, svg, textPathF, transitionSpeed, tree, updateData, width;

	tree = {
	"name": "vp",
	"label": "Vendor Portal",

	(function() {
	define([], function() {
	return function(){
	container = ".present[data-markdown]";
	//insert code here
	};
	});

	}).call(this);