#16083: MCQD to compute max cliques
-------------------------+-------------------------------------------------
Reporter: | Owner:
ncohen | Status: needs_review
Type: | Milestone: sage-6.3
enhancement | Resolution:
Priority: major | Merged in:
Component: graph | Reviewers:
theory | Work issues:
Keywords: | Commit:
Authors: | a555604888f8f5fd3ab4846a379c8719ae7a7de6
Nathann Cohen | Stopgaps:
Report Upstream: N/A |
Branch: |
public/mcqd |
Dependencies: |
-------------------------+-------------------------------------------------
Comment (by azi):
Okay, so I was missing the step of running sage -b. Thanks Nathann for the
private email.
As for this ticket I'd just like to hear the answer to
''Why you use double variables for the adjacency matrix? Is there any
benefit from allocating a n*n matrix and using a nested for loop to fill
it?''
(as posted above) and if sage -t works for you then we are good to go!!
--
Ticket URL: <http://trac.sagemath.org/ticket/16083#comment:15>
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/d/optout.
