#10549: Improvements in canonical_form, is_isomorphic, and
graph_isom_equivalent_non_edge_labeled_graph
-------------------------------+--------------------------------------------
Reporter: stumpc5 | Owner: jason, ncohen, rlm
Type: enhancement | Status: needs_work
Priority: major | Milestone:
Component: graph theory | Keywords: graph, canonical form,
isomorphism
Author: Christian Stump | Upstream: N/A
Reviewer: Robert Miller | Merged:
Work_issues: |
-------------------------------+--------------------------------------------
Comment(by stumpc5):
Replying to [comment:3 rlm]:
> Another problem is that copying graph backends is not currently
implemented. However, it may seem to be when the line `G._backend = copy(
g._backend )` executes without error.
I now only make G = copy( g ), so this is again quite slow. But I don't
see a better way to do it, do you?
> Also, this could have better coding style: `for i in [ v for v in g if v
not in G_vertices ]:`. This could be `for i in g if i not in G_vertices:`,
as there is no need to construct a list there.
done.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/10549#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.
