#17582: Bandwidth of a graph
-------------------------+-------------------------------------------------
Reporter: | Owner:
ncohen | Status: needs_review
Type: | Milestone: sage-6.5
enhancement | Resolution:
Priority: major | Merged in:
Component: graph | Reviewers:
theory | Work issues:
Keywords: | Commit:
Authors: | df12b0e059f074b7d39c09434d61b8d74a3dd009
Nathann Cohen | Stopgaps:
Report Upstream: N/A |
Branch: |
public/17582 |
Dependencies: |
-------------------------+-------------------------------------------------
Comment (by dcoudert):
This is impressive!
I haven't tested yet the patch, but I already have few comments:
- With the instruction `G = G.relabel(inplace=False) # int-labelled` you
loose the original labels of the vertices. You should either store the
original label to return an ordering with original names, or write in the
doc of the method that the ordering is a permutation of the vertices
according the original ordering in the graph, or what is best to write.
- in the `if (d is NULL or distances is NULL or ...` you should add a
`return blah blah`.
Now I'm trying to figure out the worse case time complexity of your
algorithm, and of course if it is exact ;)
More later.
--
Ticket URL: <http://trac.sagemath.org/ticket/17582#comment:4>
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.
