#19632: Haemers srgs
-------------------------+-------------------------------------------------
Reporter: | Owner:
dimpase | Status: needs_review
Type: | Milestone: sage-6.10
enhancement | Resolution:
Priority: major | Merged in:
Component: graph | Reviewers:
theory | Work issues:
Keywords: | Commit:
Authors: Dima | 0b551841289a54e383c73b2e57237d9a6bd52e2e
Pasechnik | Stopgaps:
Report Upstream: N/A |
Branch: |
u/dimpase/haemers |
Dependencies: |
#19463, #19624 |
-------------------------+-------------------------------------------------
Comment (by ncohen):
> Are you saying that relabel() can reorder vertices? Indeed, the code
depends on it keeping them
> in the same order.
'reorder' ? Nono, it will not 'reorder' them, i.e. the ith vertex of
g.vertices() is the ith vertex of g.vertices() after a relabel
{{{
if perm is None:
perm = dict({v:i for i,v in enumerate(self.vertices())})
}}}
But if you have to explain in the doc what exactly the ith vertex
represents when he provides a partition, well, we might as well use their
original labels (i.e. before relabelling)
Nathann
--
Ticket URL: <http://trac.sagemath.org/ticket/19632#comment:11>
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 unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at http://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.
