Re:Ask HN: "a piece of code you're proud of" - what does it ...
by relix on Sunday September 12, 2010 @07:21AM
(#1683463)
I've implemented a solution to the maximal clique problem in a very elegant way, and have used that piece of code in the past, because it's optimal and quite small (about 100 lines). I guess that fits your description, so I've been on the right track all along.
Thanks for your suggestion of online judges. I didn't know there was such a market for code-judges, interesting!
Re:Ask HN: "a piece of code you're proud of" - what does it ...
by RiderOfGiraffes on Sunday September 12, 2010 @07:34AM
(#1683475)
Given that problem is NP-Hard I'd be interested to see your code.
Re:Ask HN: "a piece of code you're proud of" - what does it ...
by relix on Sunday September 12, 2010 @07:46AM
(#1683491)
It's an implementation of the Bron-Kerbosch algorithm [1].
[1]: http://en.wikipedia.org/wiki/Bron%E2%80%93Kerbosch_algorithm
Re:Ask HN: "a piece of code you're proud of" - what does it ...
by RiderOfGiraffes on Sunday September 12, 2010 @07:53AM
(#1683499)
That link didn't work for me, this one does:
http://en.wikipedia.org/wiki/Bron-Kerbosch_algorithm
Thanks.
Perhaps you could put together the most elegant solution (to your taste) of a well-known toy problem, and use that in such situations?
Online judges are eminently suited to this sort of task. They're a-dime-a-dozen these days. Heck, you'll find one in my profile!