#14967: Bug with DiGraph
--------------------------------+--------------------------
Reporter: mercatp | Owner:
Type: defect | Status: new
Priority: major | Milestone: sage-5.11
Component: graph theory | Resolution:
Keywords: graph | Merged in:
Authors: Paul Mercat | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Dependencies:
Stopgaps: |
--------------------------------+--------------------------
Comment (by mercatp):
The last correction that I proposed doesn't work because {{{u}}} can also
be of type {{{Integer}}} or {{{IntMod}}} in many tests (we should write
{{{if type(u) == int or if type(u) == Integer or type(u) == IntMod:}}}).
I think that the right way to have fast algorithms with usuals graphs
would be to use a different implementation for theses graphs, with vertex
labeled by integers 0, 1, 2, ...
You will just have to check at the initialization which implementation we
should use (and it's not a problem if it's slow here I think), and then it
uses the best implementation to manipulate the graph.
I think it will not be difficult to do this.
Do you think it's a good idea ?
--
Ticket URL: <http://trac.sagemath.org/ticket/14967#comment:4>
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.
