#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 ncohen):
Hellooooooooooooooooo !
We can do as you say, but in that case I will create a ticket afterward to
fix only that part, for I believe I should be simplified `:-)`
As for DiGraph objects, we can indeed use is_vertex_transitive on them
(and it makes sense !)
{{{
sage: d = DiGraph()
sage: d.add_edge(0,1)
sage: d.is_vertex_transitive()
False
sage: d.add_edge(1,0)
sage: d.is_vertex_transitive()
True
}}}
Nathann
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/13721#comment:25>
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.
