Grouping graph vertices

Feb 17, 2010 at 4:03 AM

I have been working on a small app which analyses linkages between databases in a large corporate environment.

Currently I've loaded all my databases and created a vertex for each unique database path, and additionally created edges in an AdjacencyGraph between linked databases.  

What I would like to do is now "cluster" my databases together and create a unique "group ID" for each group of linked databases so that I can identified interdependencies.

I started playing around with a depth first search algorithm but got a bit lost.  

Would anyone be able to shed some light on how I might achieve this, or any good references where I can read the theory and implement it correctly?




Feb 17, 2010 at 6:10 PM
Edited Feb 17, 2010 at 6:11 PM

Is using Visual Studio 2010 an option for you?  It appears to have some technology related to "DGML" graphs that may come in handy, see e.g.

QuickGraph supports DGML now.