Im building a graph with over 90000 edges:
DefaultDirectedGraph graph = ...
graph.addVertex(keyFrom);
graph.addVertex(keyTo);
graph.addEdge(keyFrom, keyTo);
With new version I have following results:
- BUILD_GRAPH took 13596 ms Number of edges: 90469
- BUILD_GRAPH took 14354 ms Number of edges: 94309
- BUILD_GRAPH took 6647 ms Number of edges: 90465
With the old Version I have following results::
- BUILD_GRAPH took 5081 ms Number of edges: 90469
- BUILD_GRAPH took 3949 ms Number of edges: 94309
- BUILD_GRAPH took 4351 ms Number of edges: 90466
Profiler told me that this code is slow in the lib:
UniformIntrusiveEdgesSpecifics:
return edgeMap.putIfAbsent(e, intrusiveEdge) == null;
I tried to improve the hashCode of vertex. But it does not help. I would like to switch to the new version of the lib. But performance is an issue. Any idea, why the new version of the lib is slower?