#5793: [with patch, needs work] New algorithm for Max Clique in Graph class
using
Cython
--------------------------+-------------------------------------------------
Reporter: ncohen | Owner: rlm
Type: enhancement | Status: reopened
Priority: minor | Milestone: sage-4.1.1
Component: graph theory | Resolution:
Keywords: | Reviewer:
Author: | Merged:
--------------------------+-------------------------------------------------
Comment(by rlm):
It seems as if Cliquer is subtracting one from each vertex in the input,
and so the input needs to have one added to it. To see this, apply
`trac_5793_debug_only.patch`, and you get:
{{{
sage: G = Graph({0:[1,2,3], 1:[2], 3:[0,1]}); G.maximum_clique()
(0, 1, None)
e 0 1
Unweighted graph has 4 vertices, 0 edges (density 0.00).
0 ->
1 ->
2 ->
3 ->
(0, 2, None)
e 0 2
Unweighted graph has 4 vertices, 0 edges (density 0.00).
0 ->
1 ->
2 ->
3 ->
(0, 3, None)
e 0 3
Unweighted graph has 4 vertices, 0 edges (density 0.00).
0 ->
1 ->
2 ->
3 ->
(1, 2, None)
e 1 2
Unweighted graph has 4 vertices, 1 edges (density 0.17).
0 -> 1
1 -> 0
2 ->
3 ->
(1, 3, None)
e 1 3
Unweighted graph has 4 vertices, 2 edges (density 0.33).
0 -> 1 2
1 -> 0
2 -> 0
3 ->
[0, 2]
}}}
You should probably also expose at least this `print_graph` function in
the official versions.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/5793#comment:22>
Sage <http://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
-~----------~----~----~----~------~----~------~--~---
