quote:Original post by Zahlman If I understand your question correctly... google for "maximum clique". ... and shortly after that find out that you are trying to solve a NP-complete problem which I doubt you will succeed at. I fact I know you will fail.
Cancel
Save
I may be getting older, but I refuse to grow up
Yeah I said cycles but that''s wrong. It''s actually finding the largest complete subgraph.
Cancel
Save
Yeah it sounds NP-complete, but that''s not bad because all NP-complete problems have the same solution. 1) Enumerate all possible solutions 2) Pick the correct answer NP-complete problems are a pain because they become intractable quickly, not because they are hard to solve.
Cancel
Save
I think you guys are right, an absolutely correct answer requires calculating all possibilities and taking the best one. Thats a bummer but well... -CProgrammer
Cancel
Save