#8878: Use Dijkstra to discover shortest coercion path
---------------------------------+------------------------------------------
Reporter: nthiery | Owner: robertwb
Type: defect | Status: needs_work
Priority: major | Milestone:
Component: coercion | Keywords: coercion, morphism
Author: Nicolas M. Thiéry | Upstream: N/A
Reviewer: | Merged:
Work_issues: |
---------------------------------+------------------------------------------
Changes (by nthiery):
* status: new => needs_work
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/8878#comment:1>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/sage-trac?hl=en.
