-
-
Notifications
You must be signed in to change notification settings - Fork 405
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Add call to cliquer with custom cliques sizes #29269
Comments
Changed author from Fightlapa to Jakub Jabłoński |
Changed branch from cliquer_custom_size to public/cliquer_custom_size |
Branch pushed to git repo; I updated commit sha1. New commits:
|
Commit: |
comment:4
Code could be reused, as this is almost copy-paste of another function. But if it will be fine, will do that and push "clean" version. |
comment:5
Welcome to Sagemath. You could add tests of corner cases, like small graphs (empty, 1 or 2 vertices), disconnected graphs and graphs with multiple edges. Have you tested the code on a large graph to see what it supports ? Also, you will have to improve the coding style (see https://www.python.org/dev/peps/pep-0008/) and ensure that comments are formatted in 80 columns mode. |
comment:6
I'm still testing it. I see already one wrong result. I'm investigating it now. |
Branch pushed to git repo; I updated commit sha1. New commits:
|
comment:9
a few comments
+ Return the vertex sets of *ALL* the complete subgraphs.
+ Returns the vertex sets of *ALL* the complete subgraphs.
I don't know if it is possible, but it would be much better if we could turn this method into an iterator. If the number of cliques to report is large, we may have a segfault. Not clear if the design of cliquer allows that. |
comment:10
According the documentation of cliquer (https://users.aalto.fi/~pat/cliquer.html), it seems possible to avoid storing all cliques (re-entrant methods). So it seems possible to make an iterator, but I don't know how complex it is to do so. |
Branch pushed to git repo; I updated commit sha1. New commits:
|
Branch pushed to git repo; I updated commit sha1. New commits:
|
comment:13
Sorry for those messy commits. Anyway, it's my first time with Cython, I'm not also that familiar with c++. I think I'm not capable of making iterator out of it. |
comment:14
- - ``min_size`` -- Search for cliques with weight at least N. If N=0,
- searches for maximum weight clique (default).
+ - ``min_size`` -- integer (default: 0); minimum size of the cliques to report.
+ When set to 0 (default), searched for a maximum weight clique.
|
Changed commit from |
Changed branch from public/cliquer_custom_size to public/graphs/29269_all_cliques |
Branch pushed to git repo; I updated commit sha1. New commits:
|
Commit: |
Reviewer: David Coudert |
comment:42
a small review commit to avoid using variable If OK for you, you can set this ticket to positive review on my behalf. Don't forget to add your name as co-author. |
Changed author from Jakub Jabłoński to Jakub Jabłoński, Jonathan Kliem |
comment:44
The "Dependencies" field must be a list of trac tickets |
Changed dependencies from cliquer to none |
comment:45
Sorry, missed that. That's obsolete as cliquer is a standard package. |
comment:46
Merge conflict, please fix |
comment:47
this might be due to #29518. So let's wait for next release to see what's the conflict. |
Changed branch from public/graphs/29269_all_cliques to public/29269_reb |
Changed commit from |
Commit: |
Changed branch from public/29269_reb to public/29269-reb |
New commits:
|
comment:52
LGTM. |
Changed branch from public/29269-reb to |
Currently only maximum/maximal cliques can be obtained by calling cliquer functions. With this change custom cliques can be obtained with cliquer.
Component: graph theory
Keywords: cliquer
Author: Jakub Jabłoński, Jonathan Kliem
Branch/Commit:
e1774f7
Reviewer: David Coudert
Issue created by migration from https://trac.sagemath.org/ticket/29269
The text was updated successfully, but these errors were encountered: