5 Коммитов

Автор	SHA1	Сообщение	Дата
Mike Bostock	ced7b7242b	Better force-directed layout. ... Use the Floyd-Warshall algorithm to compute the shortest path between nodes, and use that graph theoretic distance as the distance constraint for the Gauss- Seidel relaxation. In addition, have the constraint alpha decay over time, as in Simulated Annealing.	2011-02-27 18:22:23 -08:00
Michael Bostock	7b1df15bfe	Restructure force example.	2011-02-27 12:09:27 -08:00
Jeffrey Heer	633a931f5b	Add cardinal splines and clustered graph example	2010-12-15 09:32:29 -08:00
Michael Bostock	27dbb5a0fa	Custom easing. Public d3.dispatch.	2010-10-24 12:40:26 -07:00
Mike Bostock	ae0d06f209	Checkpoint examples.	2010-09-28 11:34:52 -07:00