#12770: cartesian product of directed graphs
-------------------------------------------+--------------------------------
Reporter: chapoton | Owner: jason, ncohen, rlm
Type: defect | Status: needs_review
Priority: major | Milestone: sage-5.0
Component: graph theory | Resolution:
Keywords: directed graph, product | Work issues:
Report Upstream: N/A | Reviewers:
Authors: David Coudert | Merged in:
Dependencies: | Stopgaps:
-------------------------------------------+--------------------------------
Comment (by dcoudert):
> * It would be better if the examples given check something else than the
fact that the number of vertices is correct. One can for example count the
edges.
>
> * Maybe remove the plot in the examples, which has not much to do there.
It was original examples. I removed them. They are not so useful.
> * Maybe check the commutativity of the product
Already done with is_isomorphic tests.
> * Maybe it would be good to have a test with loops ?
I added a test with loops: small De Bruijn product an arc. The resulting
digraph contains 2 copies of the debruijn and arcs from vertices in one
copy to corresponding vertex in other copy.
Should be better now.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/12770#comment:5>
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.
