#14837: Implement graph join operation
-----------------------------------------+----------------------------------
Reporter: azuge | Owner: jason, ncohen, rlm
Type: enhancement | Status: needs_info
Priority: minor | Milestone: sage-5.12
Component: graph theory | Resolution:
Keywords: graph join | Work issues:
Report Upstream: N/A | Reviewers: Nathann Cohen
Authors: Alexandre Prusch Züge | Merged in:
Dependencies: | Stopgaps:
-----------------------------------------+----------------------------------
Comment (by azuge):
Hello!!
You are correct that I used the same code for relabeling (for
conciseness), since I do not see how to know which vertices come from
which graph without actually recalculating the labels. Unfortunately I
ended up duplicating code...
Now that I am thinking about it, I believe a good solution is to create a
helper function to calculate the labels and use this function both in
disjoint_union and in join.
What do you think?
(And what should I do? Is there a way to replace the attached patch or
should I post a new attachment?)
Alexandre
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/14837#comment:3>
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.
