Opened 10 years ago
Last modified 8 months ago
#7676 needs_work enhancement
shortest_path_all pairs in Cython through Floyd Warshall
Reported by: | ncohen | Owned by: | rlm |
---|---|---|---|
Priority: | major | Milestone: | sage-wishlist |
Component: | graph theory | Keywords: | |
Cc: | Merged in: | ||
Authors: | Reviewers: | ||
Report Upstream: | N/A | Work issues: | |
Branch: | Commit: | ||
Dependencies: | Stopgaps: |
Description
Everything is explained there :
http://en.wikipedia.org/wiki/Floyd%E2%80%93Warshall_algorithm
Change History (6)
comment:1 Changed 9 years ago by
- Status changed from new to needs_work
comment:2 Changed 6 years ago by
- Milestone changed from sage-5.11 to sage-5.12
comment:3 Changed 6 years ago by
- Milestone changed from sage-6.1 to sage-6.2
comment:4 Changed 5 years ago by
- Milestone changed from sage-6.2 to sage-6.3
comment:5 Changed 5 years ago by
- Milestone changed from sage-6.3 to sage-6.4
comment:6 Changed 8 months ago by
- Milestone changed from sage-6.4 to sage-wishlist
Note: See
TracTickets for help on using
tickets.
According to https://ask.sagemath.org/question/44823/sage-floyd-algorithm-in-cython/ SciPy? already includes an implementation of this that is quite fast, and should probably be used over any implementation in Sage.