/** HG: measures time needed to check a pair of huge random graphs */
@Test
public void testHugeGraph() {
int n = 700;
long time = System.currentTimeMillis();
DirectedGraph<Integer, DefaultEdge>
g1 = SubgraphIsomorphismTestUtils.randomGraph(n, n * n / 50, 12345),
g2 = SubgraphIsomorphismTestUtils.randomSubgraph(g1, n / 2, 54321);
VF2SubgraphIsomorphismInspector<Integer, DefaultEdge> vf2 =
new VF2SubgraphIsomorphismInspector<>(g1, g2);
assertEquals(true, vf2.isomorphismExists());
SubgraphIsomorphismTestUtils.showLog(
"|V1| = "
+ g1.vertexSet().size()
+ ", |E1| = "
+ g1.edgeSet().size()
+ ", |V2| = "
+ g2.vertexSet().size()
+ ", |E2| = "
+ g2.edgeSet().size()
+ " - "
+ (System.currentTimeMillis() - time)
+ "ms");
}
/*
* Creates a VertexData object for every vertex in the graph and stores
* them
* in a HashMap.
*/
private void createVertexData() {
vertexToVertexData = new HashMap<V, VertexData<V>>(graph.vertexSet().size());
for (V vertex : graph.vertexSet()) {
vertexToVertexData.put(vertex, new VertexData2<V>(vertex, false, false));
}
}
private JavaClass findClass(String classname) {
for (JavaClass jClass : graph.vertexSet()) {
if (jClass.getName().equals(classname)) {
return jClass;
}
}
return null;
}
public Set<String> getIndexedClasses() {
Set<String> classes = newHashSet();
Set<JavaClass> vertexSet = graph.vertexSet();
for (JavaClass each : vertexSet) {
classes.add(each.getName());
}
return classes;
}