mouly

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.

Compare to this Cartesian layout.

	<link rel="import" href="../components/polymer/polymer.html">

	<polymer-element name="my-element">

	<template>
	<style>
	#core_card {
	position: absolute;
	width: 510px;
	height: 370px;

	{
	"nodes": [
	{"name": "d3"},
	{"name": "d3.svg"},
	{"name": "d3.svg.area"},
	{"name": "d3.svg.line"},
	{"name": "d3.scale"},
	{"name": "d3.scale.linear"},
	{"name": "d3.scale.ordinal"}
	],

	<!DOCTYPE html>
	<html>
	<head>
	<meta charset="utf-8">

	</head>
	<body>
	<script src="https://ajax.googleapis.com/ajax/libs/jquery/1.6.1/jquery.min.js"></script>
	<script src="//cdnjs.cloudflare.com/ajax/libs/backbone.js/1.0.0/backbone-min.js"></script>