#9581: edge_incident bug in generic_graph.py
----------------------------+-----------------------------------------------
Reporter: vdelecroix | Owner: vdelecroix
Type: defect | Status: positive_review
Priority: major | Milestone: sage-4.6
Component: graph theory | Keywords: graph
Author: vdelecroix | Upstream: N/A
Reviewer: | Merged:
Work_issues: |
----------------------------+-----------------------------------------------
Description changed by ncohen:
Old description:
> Currently, the edge_incident method of generic graph calls edge_boundary
> which first take a lot of time and secondly does not work
>
> {{{
> sage: G = Graph(loops=True)
> sage: G.add_edge(0,0)
> sage: G.edges()
> [(0, 0, None)]
> sage: list(G.edge_iterator(0))
> [(0, 0, None)]
> sage: G.edges_incident(0)
> []
> }}}
>
> The ticket also aims to reduce multiple calls (edge_boundary does not
> call directly edge_iterator as it should).
>
> It is also the occasion to add some doc and correct some typos.
New description:
Currently, the edge_incident method of generic graph calls edge_boundary
which first take a lot of time and secondly does not work
{{{
sage: G = Graph(loops=True)
sage: G.add_edge(0,0)
sage: G.edges()
[(0, 0, None)]
sage: list(G.edge_iterator(0))
[(0, 0, None)]
sage: G.edges_incident(0)
[]
}}}
The ticket also aims to reduce multiple calls (edge_boundary does not call
directly edge_iterator as it should).
It is also the occasion to add some doc and correct some typos.
Apply first :
* #10043
* #10101
* #9698
--
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/9581#comment:9>
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.
