#13239: Contraction of edges in a graph.
------------------------------------------------+---------------------------
Reporter: lkeough | Owner: jason,
ncohen, rlm
Type: enhancement | Status: needs_info
Priority: major | Milestone: sage-5.3
Component: graph theory | Resolution:
Keywords: SD40 | Work issues:
Report Upstream: N/A | Reviewers: Marshall
Hampton, David Coudert
Authors: Lauren Keough, Jeremy Martin | Merged in:
Dependencies: | Stopgaps:
------------------------------------------------+---------------------------
Comment (by lkeough):
Replying to [comment:6 dcoudert]:
> If the #7304 function is not adapted to your purpose, it could be better
to include the code in your function instead of creating a new one.
>
> May be some people from Sage Days could give good advise.
A couple of graph theorists at Sage Days said they would prefer to have a
function by the name of contraction that does what I described in the
documentation for this one. It is very easy to adapt their code and call
it contraction. I'm going to try both things and time them to see which
is faster. Thanks!
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/13239#comment:7>
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.
