[SOLVED] Layout using weights in fully connected graph?

[ervler]

I just realised that I probably originally posted this query in the wrong section ("") so forgive the re-post here, but I think this is a more relevant venue. Thanks!

The original question:

I am working with a network in which every node is connected to every other node, but there is a huge disparity in the weight of these connections. Does Gephi include some kind of layout, clustering or modularity algorithm that allows me to easily visually (and analytically) group nodes together based on the weight of the edge between them?

I'm new to Gephi so I hope this isn't a totally inane request

Thanks in advance!

P.S. The edges are undirected, although I might be able to create some kind of directed proxy measure if necessary...

[mbastian]

That sounds a perfect candidate for the OpenOrd layout.

[ervler]

Thanks for the tip! I will check it out...