| CC: | bug-Graph-Clique [...] rt.cpan.org |
| Subject: | A bug in Graph-Clique-0.02 |
| Date: | Fri, 05 Dec 2008 17:27:21 -0500 |
| To: | ewijaya [...] singnet.com.sg |
| From: | Jianlong Qi <q_jianlo [...] encs.concordia.ca> |
Hi,
I am using Graph-Clique-0.02 to extract the maximum clique from a
graph. I have 2 thousands small graphs that consists of at most 7
vertexes. When i repeatedly run getcliques, i found a problem. If i
have two graphs with the same structures and run them one by one, i
could not get correct answer in the second execution. Below code is an
example:
my @edges = ([1,2], [1,3], [1,4], [1,5],[2,3], [2,4],[3,4],[5,6],
[5,7], [5,9],
[6,9],[7,8],[8,9],);
my $k = shift || 3;
my @cliques = getcliques($k,\@edges);
print join("\n", @cliques), "\n";
my @new_edges = ([1,2], [1,3], [1,4], [1,5],[2,3], [2,4],[3,4],[5,6],
[5,7], [5,9],[6,9],[7,8],[8,9],);
# This call could not return any result.
my @new_cliques = getcliques($k,\@new_edges);
print join("\n", @new_cliques), "\n";
As i have a lot of graphs to process, some of them may have the same
structures.
Any suggestion for this problem?
Thanks a lot
Jianlong