We closed this forum 18 June 2010. It has served us well since 2005 as the ALPHA forum did before it from 2002 to 2005. New discussions are ongoing at the new URL http://forum.processing.org. You'll need to sign up and get a new user account. We're sorry about that inconvenience, but we think it's better in the long run. The content on this forum will remain online.
IndexProgramming Questions & HelpOther Libraries › finding cluster in a big network graph...
Page Index Toggle Pages: 1
finding cluster in a big network graph... (Read 463 times)
finding cluster in a big network graph...
Jan 18th, 2009, 3:00pm
 
Hi everyone here!

I'm using delicious lib + some classes borrowed in THE "visualizing data" book (thx ben!)

I'd like to explore dynamic clusters detection field.

what would be your way?
dump gml files and use algorithms on it? or staying in dynamic visualiation way?

Re: finding cluster in a big network graph...
Reply #1 - Jan 18th, 2009, 6:14pm
 
following page may help you.
http://www.processing.org/hacks/hacks:graphtheory
Page Index Toggle Pages: 1