2014-05-12 05:45:49 +0200 | received badge | ● Famous Question (source) |

2013-12-02 23:39:04 +0200 | received badge | ● Notable Question (source) |

2013-10-06 07:44:50 +0200 | received badge | ● Popular Question (source) |

2013-08-21 20:07:19 +0200 | received badge | ● Teacher (source) |

2013-08-21 20:07:19 +0200 | received badge | ● Self-Learner (source) |

2013-08-14 17:33:03 +0200 | commented answer | Finding all shortest paths between given (specific) pair of vertices there you go :) |

2013-07-26 07:50:30 +0200 | commented answer | Finding all shortest paths between given (specific) pair of vertices Hello! The all_dist dictionary comes from "distance_all_pairs" method, mentioned by Nathann. If you add something like "all_dist = G.distance_all_pairs()" in the beginning, it should work. If you wish, I can publish full code here, but I would rather not, since I am not really sage master myself :) |

2013-07-16 00:35:03 +0200 | received badge | ● Nice Question (source) |

2013-07-15 11:54:35 +0200 | received badge | ● Student (source) |

2013-07-15 10:07:51 +0200 | answered a question | Finding all shortest paths between given (specific) pair of vertices The method, suggested by Nathann is the following: Given such list (p_l), it is easy to recursively construct a list of shortest paths from vertex a to vertex b, as follows: rickhg12hs: here is my code snippet. This works for me :) Make sure to have networkx imported. |

2013-07-15 09:57:05 +0200 | commented answer | Finding all shortest paths between given (specific) pair of vertices I do not know how to paste the code here, therefore I wrote an answer below. |

2013-07-09 11:21:11 +0200 | received badge | ● Supporter (source) |

2013-07-09 11:20:39 +0200 | commented answer | Finding all shortest paths between given (specific) pair of vertices Thank you, but this is too much brute force for me. Anyway, it is good to know all_paths function. |

2013-07-09 11:19:48 +0200 | commented answer | Finding all shortest paths between given (specific) pair of vertices That is a good approach. Little more work on my side, but it gets the job done. |

2013-07-09 11:19:09 +0200 | received badge | ● Scholar (source) |

2013-07-09 11:19:09 +0200 | marked best answer | Finding all shortest paths between given (specific) pair of vertices You can easily find the list of all predecessors : just call the "distance_all_pairs" method, and you can then get all predecessors of x in a shortest Nathann |

2013-07-09 07:54:50 +0200 | received badge | ● Editor (source) |

2013-07-09 07:45:53 +0200 | asked a question | Finding all shortest paths between given (specific) pair of vertices I am working with graphs in sage and need a method of finding all shortest paths between some pair (or all pairs) of vertices. Note that it is important to have all shortest paths registred, not just one, as seen in many Bellman-Ford/Dijkstra implementations (for instance Graph.shortest_path_all_pairs or networkx.algorithms.shortest_paths.all_pairs_shortest_path), and not just a number of those paths. I am also satisfied with only a list of "optimal" predecessors... as long as the list is complete. Thank you for answers! |

Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.