#13721: Additional tests for graph symmetries and an improvement of
is_vertex_transitive
----------------------------------+-----------------------------------------
Reporter: azi | Owner: jason, ncohen, rlm
Type: enhancement | Status: needs_work
Priority: major | Milestone: sage-5.6
Component: graph theory | Resolution:
Keywords: | Work issues:
Report Upstream: N/A | Reviewers:
Authors: Jernej Azarija | Merged in:
Dependencies: | Stopgaps:
----------------------------------+-----------------------------------------
Comment (by boothby):
1. There's been a misunderstanding here. My point is that
{{{
sage: G = Graph([(0,1,[])])
sage: G.line_graph()
}}}
results in an error because lists are not hashable (and vertices of graphs
must be hashable). And so, I think that it's reasonable for the same
graph to fail in other places because of the same reason. Also, this
should be documented.
2. I'd like somebody else's opinion here. I love the amount of stuff we
can do with graphs... but I hate the length of the list. ;)
3. Okay, yeah, I shouldn't be asking for new features.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/13721#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 post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/sage-trac?hl=en.
