Dan Schult

If I understand correctly, eulerian doesn't involve egde weights on the graph itself -- but this algorithm for "eulerizing" (is that even a word?) a graph tries to add as...

That sounds like it should have a different function, unless there is an easy way to find the edges which eulerize and are minimal. Typically the computation needed for weighted...

Yes -- @rfulekjames please make a PR to fix the bug! We can help with any first-time questions you might have. Thanks!

Well -- you can use it now via the branch of the PR, but I think you mean: when will it be merged with the NetworkX repo? We like these...

That is a reasonable result. If nodes in the graph are not connected then you can't compute all shortest paths between all pairs of nodes. There is no path between...

Point taken -- it is certainly not an optimal result if you want the partial results given by the pairs that are connected. As you point out, the current `all_pairs_shortest_path`...

It should return all shortest paths. It could be that you are running into round-off trouble or maybe another subtle distinction. Can you give a small example that has at...

Ahh... you are using `all_pairs_shortest_path` which finds a shortest path between all the pairs of nodes in the graph. So it's not finding all paths. It is finding all **pairs**....

How about: `nx.all_shortest_paths` https://networkx.org/documentation/stable/reference/algorithms/generated/networkx.algorithms.shortest_paths.generic.all_shortest_paths.html

Very good -- that would perhaps be a nice new feature. If you click on the "Source" link at the top of the documentation link, you can see that most...