find articulation point in graph On 29 Apr 2014 16:56, "shashi kant" <[email protected]> wrote:
> Problem is as follows: > > 1. Given a connected graph. > 2. Remove a vertex out of it and if graph is divided into two components > return that vertex. > 3. else find a set of vertices to be removed that will divide graph into > more than 1 component. > > > > Please Help me out here .. probably min-cut problem > http://www.geeksforgeeks.org/minimum-cut-in-a-directed-graph/ is suitable > here. > > > *Thanks & Regards,* > *Shashi Kant * > *"Think positive and find fuel in failure"* > http://thinkndoawesome.blogspot.com/ > *Senior Software Engineer* > *Samsung Research India Bangalore .* > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To unsubscribe from this group and stop receiving emails from it, send an > email to [email protected]. > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected].
