It is also an application of depth first traversal. Articulation point is a vertex which if removed will leave the graph unconnected.
Since i do not completely remember the algorithm myself, i would recommend you to refer Mark Allan Weiss's book on Data Structures and Algorithms in C++ and Graphs chapter. He has nicely explained this algorithm. On Oct 24, 2:23 am, kartik sachan <kartik.sac...@gmail.com> wrote: > yup but didn't get much out of it....... -- 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 algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
