Hi! I have to calculate minimal cycles bases for a bunch of graphs each of have around 500-1000 nodes (in that range). The algorithm implemented in NetworkX takes extremely long. While I’ve noticed it is extremely fast in mathematica. However, I want to be able to use a method that is native to python environment. So, does IGraph implement a faster method for calculating cycle basis? Or any other method I am not aware of, that is faster and can be implemented in python is useful too.