#13192: some code clean up for sage/graphs/graph.py
----------------------------------+-----------------------------------------
Reporter: eisermbi | Owner: jason, ncohen, rlm
Type: defect | Status: needs_review
Priority: major | Milestone: sage-5.2
Component: graph theory | Resolution:
Keywords: sparse6_string | Work issues:
Report Upstream: N/A | Reviewers: Nathann Cohen, Karl-Dieter
Crisman
Authors: Birk Eisermann | Merged in:
Dependencies: #13109 | Stopgaps:
----------------------------------+-----------------------------------------
Comment (by eisermbi):
Okay, I think I got the meaning. First, there was nothing really wrong
before. The quote does not refer to sparse6_string. It refers to
compare_edges which can only be apply to graph edges whose vertices are
comparable with "<". It has always been possible to use sparse6_string
with ''any'' graph (since vertices are map to integers before sorting). So
actually everything has already been tested.
In the sparse6 format (see http://cs.anu.edu.au/~bdm/data/formats.txt) to
write a graph with vertices {0,1,...,k} the edges are traversed in the
following order (and that is why they need to be sorted):
(0,1),
(0,2),(1,2),
...,
(0,k), (1,k), ..., (k-1,k).
Any comments?
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/13192#comment:16>
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.
