Ross Barnowski

Thanks for the exmample @rudyarthur ! This is a very nice illustration of the issue and certainly demonstrates the issues w.r.t. convergence. When I run locally with thresh == 0.01...

Thank you very much @HirokiHamaguchi for yet another excellent writeup - your investigation/insights (and excellent summary) are very much appreciated! Given your findings and the previous discussion I'd be happy...

I agree with @dschult and suspect that whatever code generated the second image in the OP was not actually using a spring layout (perhaps `circular_layout` or `shell_layout` was called accidentally,...

This one's been stale for a bit and I'm quite confident the behavior in the OP is not due to a bug. Hopefully the above explanation is sufficient to address...

Are there specific features you need that are not currently supported? If so - feel free to raise issues about them. Implementing/fixing the graph formats happens more on a rolling...

Your use-case may already be supported - I know there was a recent PR to bolster support for dynamic graphs in GEXF (#7914) but that was a corner case... IIRC...

I have trouble discerning whether there is a "bug" here in the sense of incorrect answers, or whether this is just an instance of non-deterministic behavior which may or may...

The original example actually has two "strange" (though allowed) behaviors: a one-to-many mapping, and a remapping where the targets already exist in graph. I think the behavior you're seeing arises...

Continuing the work in #8318 - thanks for getting the conversation started @sourabh-sudesh-paradeshi !

This recently came up again in #5818. I think it's definitely worth adding a simple example to the `shortest_path` docstrings showing how to reconstruct the shortest path from the returned...