#15060: The empty graph once again
-------------------------------------------------+-------------------------
Reporter: darij | Owner:
Type: defect | Status: new
Priority: major | Milestone: sage-5.12
Component: combinatorics | Resolution:
Keywords: graphs, border cases, bitset, | Merged in:
memleak | Reviewers:
Authors: | Work issues:
Report Upstream: N/A | Commit:
Branch: | Stopgaps:
Dependencies: |
-------------------------------------------------+-------------------------
Comment (by ncohen):
Ahahah. I mostly agree with the first comment of
http://math.stackexchange.com/questions/50551/is-the-empty-graph-connected
: "This is not mathematics, this is theology".
Honestly, why do you insist on putting those weird definitions in Sage ?
Now you can make a disconnected graph connected by adding an isolated
vertex to it ? `:-P`
What's the point ? It's unnatural. It just confuses people. It will just
create bugs. Why can't we just say that a graph is connected if any two
vertices are linked by a path and be satisfied with that ?
--
Ticket URL: <http://trac.sagemath.org/ticket/15060#comment:2>
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/groups/opt_out.
