I just checked the shortes_path method and it wents many times faster. thnx. Am 05.02.2011 08:08, schrieb Nathann Cohen: > >> >> Of course finding the shortest path may be (almost) as expensive as >> finding all of them... If you're doing this for a lot of edges you >> might want to break it up into components, then the test would be >> easy. It would be cool if all_paths were an iterator and you could >> just ask for the first one. >> > > Nono, shortest paths are very quick to compute ! Longest paths are quite a > different thing though... :-) > > Nathann > >> >
-- To post to this group, send email to sage-support@googlegroups.com To unsubscribe from this group, send email to sage-support+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-support URL: http://www.sagemath.org
