find K maximal cliques in boost graph library

Hi,

I need to find K maximal cliques in a graph. I am currently using C++ boost graph library, but I cannot find any library to support it.

Of course, the algorithm is not limited for boost graph library. If anyone knows where to find a C++ code for it, please let me know. Many thanks.

Joe

I found a solution, called Cliquer. It works well in UNIX/LINUX. In windows, I need to change some code to make it work.