#15978: Waste of time in g.edges() (acually in iterator_edges)
-------------------------+-------------------------------------------------
Reporter: | Owner:
ncohen | Status: needs_review
Type: | Milestone: sage-6.2
enhancement | Resolution:
Priority: major | Merged in:
Component: graph | Reviewers:
theory | Work issues:
Keywords: | Commit:
Authors: | 768a63ea1d24e569a254f99b01b1f4c568198bc9
Nathann Cohen | Stopgaps:
Report Upstream: N/A |
Branch: |
u/ncohen/15978 |
Dependencies: |
-------------------------+-------------------------------------------------
Comment (by mmezzarobba):
Replying to [comment:6 ncohen]:
> > * The test `u_int <= v_int` can also be a bit expensive, perhaps due
to branch mispredictions or something like that.
>
> Hmmmm... I understand, but how can you do without ?
I was thinking of having `out_neighbors` (or a new variant of it that
would return `SparseGraphBTNode`s) filter out the vertices with `u_int <
v_int` itslef, or seeing if by chance it happens to return a sorted
list... But I have no idea (i) if it is feasible, (ii) if would be worth
the pain!
--
Ticket URL: <http://trac.sagemath.org/ticket/15978#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 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/d/optout.
