#7304: [With patch, needs review] Contract edge in graph
--------------------------+-------------------------------------------------
Reporter: AJonsson | Owner: rlm
Type: enhancement | Status: new
Priority: major | Milestone: sage-4.2.1
Component: graph theory | Resolution:
Keywords: | Work_issues:
Author: | Reviewer:
Merged: |
--------------------------+-------------------------------------------------
Changes (by AJonsson):
* status: closed => new
* resolution: duplicate =>
* milestone: sage-duplicate/invalid/wontfix => sage-4.2.1
Comment:
On second thought, reopening.
Merging vertices gives a slightly different result for certain cases that
are important in deletion-contraction algorithms, so this function has a
place to fill as well.
Example of case that contract_edge() handles differently:
If we have two vertices A, B, with two parallel edges between them, a
merging of A and B results in a single vertex with no edge or loops. If we
instead choose to contract one of the two parallel edges (and allow
loops), we will end up with a single vertex which has a loop.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/7304#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
-~----------~----~----~----~------~----~------~--~---
