From: Phlip (pplumlee_at_[hidden])
Date: 2001-03-04 02:10:26
Does Boost Graph Library have any algorithms to locate the maximum clique in
(A clique is a sub-graph in which every node links to every other node.)
If not, how would one approach this problem?
-- Phlip phlip_cpp_at_[hidden] ============== http://phlip.webjump.com ============== -- Personally qualified to snub Mensa --
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk