Time complexity for johnson's algorithm

[klauspa]

Hello, you mentioned that the complexity of johnson's algorithm is O(E+V)(C+1)
I test it with 5000 edges in a graph and 50 cycles, it runs fast. But when I try to test it with 300000 edges with 150000 cycles in there, the code just crashed. So when the graph gets pretty large, johnson's algorithm doesn't work?

Thanks!