#14999: subgraph_search does not like labeled edges
--------------------------------+--------------------------
Reporter: azi | Owner:
Type: defect | Status: new
Priority: major | Milestone: sage-5.12
Component: graph theory | Resolution:
Keywords: | Merged in:
Authors: | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Dependencies:
Stopgaps: |
--------------------------------+--------------------------
Comment (by ncohen):
Hmmmmmmmmm... Subgraph search as it is does NOT support labeled edges in
the sense that the edge labels of the small graph are assumed to be
unlabelled. And the copy of the small graph found in the large graph has
nothing to do with the labels of edges in the large graph. Just saying
`:-P`
It should probably return an exception when the small graph's edges are
labelled. Just to be clear `:-P`
But of course, what you say makes sense. For as long as you do not expect
Sage's result to change if you add many multiple edges between two
adjacent vertices in the big graph. This would be a mess `:-P`
Nathann
--
Ticket URL: <http://trac.sagemath.org/ticket/14999#comment:1>
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.
