#8878: Use Dijkstra to discover shortest coercion path
--------------------------------------+-------------------------------------
Reporter: nthiery | Owner: robertwb
Type: defect | Status: needs_work
Priority: major | Milestone:
Component: coercion | Resolution:
Keywords: coercion, morphism | Work issues:
Report Upstream: N/A | Reviewers:
Authors: Nicolas M. Thiéry | Merged in:
Dependencies: | Stopgaps:
--------------------------------------+-------------------------------------
Comment (by darij):
The link to sage-combinat is dead.
(Posting this mainly to get a CC on this ticket.)
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/8878#comment:3>
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 unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at http://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/groups/opt_out.
