Justis
May 21st, 2002, 10:38 PM
hi all.
i'm looking for a SIMPLE graph layout alogrithm that would "normalize" a graph.
say a graph has a few nodes and they all have the same coordinates, this alogrithm would make sure that they'd be evenly spread.
the simpler the better.
example -
say i have three nodes and two edges.
Node1(1,1), Node2(1,2), Node3(1,3)
Edge(Node1, Node2), Edge(Node2,Node3)
normalize (nodeArr na) - would return a graph where Node1 is still at (1,1), but the others would change their position so all nodes are same distance from each other.
thanks for your time.
any help appreciated.
i'm looking for a SIMPLE graph layout alogrithm that would "normalize" a graph.
say a graph has a few nodes and they all have the same coordinates, this alogrithm would make sure that they'd be evenly spread.
the simpler the better.
example -
say i have three nodes and two edges.
Node1(1,1), Node2(1,2), Node3(1,3)
Edge(Node1, Node2), Edge(Node2,Node3)
normalize (nodeArr na) - would return a graph where Node1 is still at (1,1), but the others would change their position so all nodes are same distance from each other.
thanks for your time.
any help appreciated.