Hello,
I have found out in this video that finding cliques is an unsolved problem.
Well I have made a program that finds them in polynomial time.
Maybe I didn't understand something , please someone set me strait.
Please try out my program, it is in the attachment.
You can read the QuickClique.cpp for explanation and source code.
Many thanks.
http://extraimago.com/images/2016/07/25/QuickClique.jpgEdit:
It has about O(m^4) complexity where m is the number of edges, and
number of edges is n choose 2 so O( (n C 2)^4 ) complexity.
(n is number of nodes)