Alejandro Candioti
Alejandro Candioti
Correct! A similar idea was proposed by @fei0319 earlier in the thread. I am planning on taking that one after we ship this one (wanted to limit the scope of...
> It looks like the latest timing results show this to uniformly speed up large graphs while not slowing smaller graphs. I haven't rerun those timing results on my machine,...
Thank you so much! Will send the follow up optimizations later 🙂
Looks good to me, no more comments from my side!
@dschult are we good to merge or should we get more reviewers?
> I'm personally not a huge fan of the data class indirection - why not just add the benchmark cases explicitly? IMO this is harder to follow! The current approach...
Oops, posted on wrong PR, sorry for the noise :) See https://github.com/networkx/networkx/pull/8059
@rossbar @dschult I removed indirection!
@rossbar friendly ping! Are you good here?
I was able to construct a complete graph that produces relaxations for each edge when running Dijkstra from node 0. This case puts a lot of pressure on the heap...