Ticket #3878 (closed defect: fixed)
[with patch, positive review] Constructing a c_graph from a DiGraph doubles the edges.
| Reported by: | saliola | Owned by: | rlm |
|---|---|---|---|
| Priority: | major | Milestone: | sage-3.1 |
| Component: | graph theory | Keywords: | c_graph |
| Cc: | Work issues: | ||
| Report Upstream: | Reviewers: | ||
| Authors: | Merged in: | ||
| Dependencies: | Stopgaps: |
Description
sage: D = DiGraph({0:[1]})
sage: D.edges()
[(0, 1, None)]
sage: DiGraph(D).edges()
[(0, 1, None)]
sage: DiGraph(D,implementation="c_graph").edges()
[(0, 1, None), (1, 0, None)]
Attachments
Change History
comment:1 Changed 5 years ago by saliola
- Summary changed from Constructing a c_graph from a DiGraph doubles the edges. to [with patch, needs review] Constructing a c_graph from a DiGraph doubles the edges.
Note: See
TracTickets for help on using
tickets.

