I have written a C++ code for finding maximum clique of an un-directed graph. It worked with small graphs and you can assume that the code is correct.
The problem are: (1) It run too slow for larger graph and (2) Memory leak occured when running the program.
I hope (1) can be solved so that it'll take about 5 - 6 minutes for current graph (now is about 45 minutes). (2) is not necessary this time.
I think it's simple task for any C++ expert and seem to take only 2-3 hours to solve.
I need it in less than a day and budget is not higher than 50$.
Please feel free to ask any question, thanks