github/d3 - d3

Граф коммитов

Автор	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

Автор

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

2 Коммитов