Zhaoyuan Deng

@rossbar Hi, as you suggested, I added some simple tests, however automatic testing is saying "Your tests failed on CircleCI", and the output isn't making much sense, is there something...

> > however automatic testing is saying "Your tests failed on CircleCI", and the output isn't making much sense, is there something I forgot to do? > > No these...

> 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...

I used an unweighted graph: ``` G = nx.Graph() G.add_node(1) G.add_node(2) G.add_node(3) G.add_node(4) G.add_edge(1, 2) G.add_edge(2, 3) G.add_edge(3, 4) G.add_edge(1, 4) path = dict(nx.all_pairs_shortest_path(G))` ``` and this is what I...

> Sorry for the cofusion, it is kind hard to describe the problem clearly. I dont think `all_simple_paths` is what I want. I don't need all paths, I only need...

> How about: `nx.all_shortest_paths` https://networkx.org/documentation/stable/reference/algorithms/generated/networkx.algorithms.shortest_paths.generic.all_shortest_paths.html it could work, but I am a bit confused why it only works for one node to one node case(single source to single target), as...

> 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...

> @dzy49 Yes，i think output partial results is more useful. Can you modify the code? Thanks a lot. I made the change and now it outputs partial results, simialr to...

@dschult @rossbar since it has been a while, should I close this and open a new pull request?

Hi, I made changes according to your suggestions! > added a note to `all_pairs_shortest_path` > fixed line width for example > changed the example to nx.cycle_graph(4) and fixed raise issue...