----- Original Message ----- From: "Mofid" <[EMAIL PROTECTED]> To: "Algorithm Geeks" <[email protected]> Sent: Saturday, March 31, 2007 12:28 AM Subject: [algogeeks] A graph problem
> > Hello! > We have a graph that is not directional. We want an algorithm to find > out if this graph is divided to two parts or not. > > mofid Two words -- "flood fill" Muntasir --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
