Member Avatar for simonsayz27
simonsayz27

I'm writing a program that builds a graph and detects articulation points. I'm stuck with the root vertex and how to find out if it is an articulation point. By definition it is iff it has more than one child but for example:

0---1
       |\  |
       |  \|
       2---3

with 0 being the root vertex, it has more than one child but does not disconnect the graph hence not being an articulation point. Can someone give me some pseudo code or point me in the right direction? I need to finish this asap.
Thanks a lot

  • 1 Contributor
  • 0 Replies
  • 51 Views
Be a part of the DaniWeb community

We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, networking, learning, and sharing knowledge.