Yup, it's definitely the same algorithm, although my approach to a solution needs work.
I currently use a recursive function - your suggestions have given me an iterative approach that I'm going to try out, and if I'm lucky it might even drastically improve my heap-space issues - thank you very much for your input! :)
----- Original Message ----- From: "Kevin Jenkins" <gameprogrammer@xxxxxxxxxx>
To: <gameprogrammer@xxxxxxxxxxxxx> Sent: Tuesday, August 18, 2009 11:10 AM Subject: [gameprogrammer] Re: Let's play... Name That Algorithm! :)
I didn't look at the code you posted, but what you describe here is exactly the algorithm I described. You are trying to find the minimum number of graphs needed to represent your set, where every vertex is connected to every other vertex. To do that, build graphs by adding vertices as long as the new vertex can connect to all existing vertices.--------------------- To unsubscribe go to http://gameprogrammer.com/mailinglist.html
--------------------- To unsubscribe go to http://gameprogrammer.com/mailinglist.html
