#15060: The empty graph once again
-------------------------------------------------+-------------------------
Reporter: darij | Owner:
Type: defect | Status: new
Priority: major | Milestone: sage-6.4
Component: combinatorics | Resolution:
Keywords: graphs, border cases, bitset, | Merged in:
memleak |
Authors: | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
Dependencies: #10093 | Stopgaps:
| inconsistencyIssue
-------------------------------------------------+-------------------------
Comment (by jakobkroeker):
I just thought, what about dropping the definition for graph connectedness
at all.
and introduce three different cases instead:
- a graph has 0 components
- a graph has exactly 1 component
- a graph has 2 or more components
At least we are able to count ;-)
I think If we cannot handle special cases consistently even in theory, we
will never ever be able to implement it without getting tons of worms...
see also the discussion at
https://groups.google.com/forum/#!msg/sage-devel/WVJ6YIURESs/cQi1U6M1QRMJ
--
Ticket URL: <https://trac.sagemath.org/ticket/15060#comment:20>
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 https://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.
