Custom Query (545 matches)

The attached patch contains the implementation of a recent heurstic algorithm for the max. clique problem. It applies an iterated local search method that is quite simple but really efficient and robust.

The patch also contains the documentation and a test file.

Please find the compiler output below

source='test/euler_test.cc' object='test/euler_test.o' libtool=no \
DEPDIR=.deps depmode=aix /bin/sh ./build-aux/depcomp \
/fs/data/edatools/prod/tools/13.1/bin/xlC -DHAVE_CONFIG_H   -I. -I.   -g -c -o test/euler_test.o test/euler_test.cc
"test/euler_test.cc", line 71.23: 1540-0229 (S) The best viable function "lemon::VectorMap<lemon::DigraphExtender<lemon::ListDigraphBase>,lemon::ListDigraphBase::Arc,int>::operator[](const Key &)" uses an ambiguous conversion sequence.
"test/euler_test.cc", line 56.6: 1540-0700 (I) The previous message was produced while processing "checkEulerIt<lemon::Undirector<lemon::ListDigraph> >(const Undirector<lemon::ListDigraph> &, const Node &)".
"test/euler_test.cc", line 203.5: 1540-0700 (I) The previous message was produced while processing "main()".
gmake[2]: *** [test/euler_test.o] Error 1

The changeset [5e1b90e430c2] in the attachment is a lognormal distribution implementation. Please review it. I would also be happy with any feedback on the interface.