Looking at the repository, it seems as if I wrote these functions, but I don't think that's right. Maybe this was one of the patches I merged from Jason Grout, while his name wasn't getting on the changesets. I seem to remember Emily Kirkman working on path functions, also. I'm not sure what the origin of this code is, but the fact that it doesn't work has been filed as a trac ticket:
http://trac.sagemath.org/sage_trac/ticket/2265 On Feb 22, 12:20 am, vgermrk <[EMAIL PROTECTED]> wrote: > This works: > graphs.CubeGraph(4).shortest_paths('0000') > but this don't: > graphs.CubeGraph(4).shortest_path_all_pairs() > > Maybe the "shortest_path_all_pairs" function needs a > "by_weight=False" parameter too (like the other shortest paths > functions). > > I also would like to have a function "all_shortest_paths(u,v)", which > returns all shortest paths from u to v. > I know i could use "all_paths" and then pick the shortest, but that's > really inefficient. --~--~---------~--~----~------------~-------~--~----~ To post to this group, send email to sage-support@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/sage-support URLs: http://www.sagemath.org -~----------~----~----~----~------~----~------~--~---
