#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: | 97f59dc2046e358f9380310883d78cb97e0f78d9
Nathann Cohen | Stopgaps:
Report Upstream: N/A |
Branch: |
public/17582 |
Dependencies: |
-------------------------+-------------------------------------------------
Comment (by ncohen):
Yop !
> Empty graph:
Done.
> Non connected graph with 2 vertices (the same holds with any non-
connected graph):
Done.
> Graph with a single vertex:
Done.
> Also could you add something to let us kill (CRTL+C) computations since
it can be very long...
Done.
Nathann
--
Ticket URL: <http://trac.sagemath.org/ticket/17582#comment:10>
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.
