ForceDirectedLayoutAlgorithm and data visualisation

Topics: algorithm
Jan 28, 2008 at 2:22 PM
First of all to the author, thanks for creating a great library. I came across the project while looking for
a .NET data visualisation library. More specifically, I am looking for ways to visualise high-dimensional
data in a graph.

One of the algorithms I know of is a force-directed algorithm, unfortunately it seems
the algorithm is not yet implemented in the QuickGraph algorithm namespace (
it throws an exception in an internal method).

I was wondering if there are any developments going on or if anyone has implemented the algorithm.
If not I'd like to try implementing it myself, however I have little experience with graph theory nor do
I write very structured code, so I'm afraid I would need some help (I am just lazy :)) or at least feedback ..

Would it make sense to have the distances between the n-dimensional objects as edge weights, call
RandomLayoutAlgorithm to initialize the positions of the nodes and somehow pass them to the
ForceDirectedLayoutAlgorithm?

Thanks,

Martijn


Coordinator
Jan 31, 2008 at 4:41 AM
That's seems like a good starting point.