there are existing algorithms to find connected components which wud do it.
On 3/30/07, Mofid <[EMAIL PROTECTED]> wrote: > > > 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 > > > > > --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
