Changes between Version 5 and Version 7 of Ticket #18067


Ignore:
Timestamp:
04/01/15 09:24:25 (6 years ago)
Author:
ncohen
Comment:

Legend:

Unmodified
Added
Removed
Modified
  • Ticket #18067

    • Property Commit changed from to 155b464eb0dee397be91f06dff894281e295d84e
  • Ticket #18067 – Description

    v5 v7  
    3636  NetworkX standards:
    3737
     38{{{
    3839      sage: import numpy
    3940      sage: A = numpy.array([[0,1,1],[1,0,1],[1,1,0]])
     
    4243       (0, 2, {0: {'weight': 1}, 1: {'weight': 1}}),
    4344       (1, 2, {0: {'weight': 1}, 1: {'weight': 1}})]
     45}}}
    4446
    4547- Several corner-cases of Graph creation are now handled differently as a
     
    4951  Before:
    5052
     53{{{
    5154      sage: g = Graph([(1,2,3),(1,2,4)], multiedges = False)
    5255      ...
    5356      ValueError: Two different labels given for the same edge in a graph without multiple edges.
     57}}}
    5458
    5559  After:
    5660
     61{{{
    5762      sage: g = Graph([(1,2,3),(1,2,4)], multiedges = False)
    5863      sage: g.edges()
    5964      [(1, 2, 4)]
     65}}}
    6066
    6167  Note that it actually makes `Graph(list_of_edges)` behave as `add_edges`
    6268  already does, as in the latest release we have:
    6369
     70{{{
    6471      sage: g = Graph()
    6572      sage: g.add_edges([(1,2,3),(1,2,4)])
    6673      sage: g.edges()
    6774      [(1, 2, 4)]
     75}}}
    6876
    6977- Fix a bug in `GenericGraph.has_multiple_edges`:
    7078
     79{{{
    7180      sage: g = Graph(loops=True,multiedges=True)
    7281      sage: g.add_edge(0,0)
    7382      sage: g.has_multiple_edges()
    7483      True
     84}}}
    7585
    7686What this branch does will also help us reduce further the complexity of those