Skip to content
Visually compare diagrams from the standard nodes algorithm with the faster node-pairs algorithm in Csharp.
Branch: master
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
ForceDirectedNodeAlgorithm
ForceDirectedNodePairAlgorithm
Properties
.gitattributes
.gitignore
App.config
ForceDirectedDiagramViewer.csproj
ForceDirectedDiagramViewer.sln
Form1.Designer.cs
Form1.cs
Form1.resx
Program.cs
README.md
screenshot.jpg

README.md

Force-directed Diagram Viewer

This application, written in C#, lets you visually compare the output from both algorithms as well as their generation statistics. Three sample data sets are included.

Application screenshot

Based upon Bradley Smith's blog post on force-directed diagrams, this algorithm uses a faster node-pair algorithm. Instead of calculating forces for every node, it only calculates for unique node pairs which reduces the total number of calculations and allows reuse of redundant values. This algorithm generally runs approximately +2x faster than the standard algorithm but due to reduced iterations, suboptimal dispersal of nodes occurs more often.

Released under the BSD license.

You can’t perform that action at this time.