- Performance tune, the Ricci curvature computation speed is up 33% compare with v0.4.4. - The pairwise shortest path is still not that idea, now it's an option only.
0.4.4
- Option for shortest path computation
The Bidirectional Dijkstra pairwise shortest path by Networkit having some problem on a larger graph, add an option for the user to select the shortest path engine, default is by all pairs shortest path, but may require more memory for larger graph.
0.4.3.1
- Some minor fix to mute the directed graph from networkit.
0.4.3
- Now optimal transportation distance and Sinkhorn distance can be limited to the top k most important neighbors (by edge weights) to speed up the distance computation.
0.4
- Switch density distribution computation from all pair shortest path to pairwise shortest path. Now a larger graph can be computed with less memory pressure.
- Directed graph computation might have some issues due to some of Networkit 6.0's bug. Suggest converting to undirected graph for computation.
0.3
Some Performance boost to make OllivierRicciCurvature computation 2x faster than previous version.
- Move untouched objects to global variables so that we don't need to send them as arguments. - Compatibility with NetworkX 2.x