Changes between Version 5 and Version 7 of Ticket #18067
 Timestamp:
 04/01/15 09:24:25 (6 years ago)
Legend:
 Unmodified
 Added
 Removed
 Modified

Ticket #18067

Property
Commit
changed from
to
155b464eb0dee397be91f06dff894281e295d84e

Property
Commit
changed from

Ticket #18067 – Description
v5 v7 36 36 NetworkX standards: 37 37 38 {{{ 38 39 sage: import numpy 39 40 sage: A = numpy.array([[0,1,1],[1,0,1],[1,1,0]]) … … 42 43 (0, 2, {0: {'weight': 1}, 1: {'weight': 1}}), 43 44 (1, 2, {0: {'weight': 1}, 1: {'weight': 1}})] 45 }}} 44 46 45 47  Several cornercases of Graph creation are now handled differently as a … … 49 51 Before: 50 52 53 {{{ 51 54 sage: g = Graph([(1,2,3),(1,2,4)], multiedges = False) 52 55 ... 53 56 ValueError: Two different labels given for the same edge in a graph without multiple edges. 57 }}} 54 58 55 59 After: 56 60 61 {{{ 57 62 sage: g = Graph([(1,2,3),(1,2,4)], multiedges = False) 58 63 sage: g.edges() 59 64 [(1, 2, 4)] 65 }}} 60 66 61 67 Note that it actually makes `Graph(list_of_edges)` behave as `add_edges` 62 68 already does, as in the latest release we have: 63 69 70 {{{ 64 71 sage: g = Graph() 65 72 sage: g.add_edges([(1,2,3),(1,2,4)]) 66 73 sage: g.edges() 67 74 [(1, 2, 4)] 75 }}} 68 76 69 77  Fix a bug in `GenericGraph.has_multiple_edges`: 70 78 79 {{{ 71 80 sage: g = Graph(loops=True,multiedges=True) 72 81 sage: g.add_edge(0,0) 73 82 sage: g.has_multiple_edges() 74 83 True 84 }}} 75 85 76 86 What this branch does will also help us reduce further the complexity of those