compare graph structure using java

I am implementing a schema matching algorithm.I need to perform schema structure matching, i need to represent schema as a is-a has-a relationship graph....one graph per schema... each node in relation model will represent开发者_JS百科 a table with is-a as table and one has-a relationship for each column(having there own is-a). My question is how to implement this in best way using java, comparing graphs will be pseudo polynomial in graph size and may through out of memory error if we pull complete schema..i want to find nodes with similar relationships in both graphs ( this will lead to DFS) is there any already existing java implementation that can do this, i already explored jgraphT, jung...not sure which one will be best to do this..please help

thanks in advance.!!

Whatever graph API you use ought to allow you to do something like this:

boolean equal = graph1.equals(graph2);

where that evaluates true if the nodesets and edgesets are equal. The nodes would need IDs or else content so you could establish actual equality as opposed to graph isomorphism.

Is that what you are asking?