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?