v0.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.

v0.4: Better support for large graph

• 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.

v0.3: Performance boost

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

v0.2

Rewrite the Ricci Curvature class and add tutorial for community detection

v0.1

Initial release