Do you have a question? Post it now! No Registration Necessary. Now with pictures!
- Edward Wijaya
November 10, 2004, 7:58 pm
rate this thread
I am planning to implement an extension to Greg Bacon's
implementation on clique reduction in a graph:
The main idea of this module is to take
input of edges and vertices from a graph,
and return all the k-cliques.
@Vertices = (1, 2, 3, 4);
@Edges = ([1,2], [1,3], [2,3], [2,4], [3,4]);
I wonder if this kind of implementation already exist in CPAN,
and if this is useful to general CPAN audience?
As far as I know, Jarkko's Graph module doesn't support that.
Any comment and insight is very much expected.
Thanks so much for your time.