I would like to create a graph (probably an organic graph in yEd terms) that shows all the nodes and all the edges between them and places the nodes at a distance from each other equal to the value of C for that pair.

An initial implementation might have some reasonable limits:

- no more than 100 nodes

- distances limited to whole numbers, with some upper limit, say 50

There is a special case when distance is zero. This could be addressed by forcing the user to scale the data in a range from 1 to 50 (i.e. by adding 1 to every value, so that there no longer are zero distances) or by allowing 0 to 50 and then devising some way of showing nodes that overlap