Member Avatar for sciprog1

Hello Members,

Given an undirected Graph, G, is there any standard algorithm to find the value of k, where (k-1) represents the number of vertices whose removal results in a graph that is still connected and the removal of the kth vertex makes the graph disconnected?

Thank you!
sciprog1

  • 2 Contributors
  • 2 Replies
  • 70 Views
  • 3 Days Discussion Span
  • Latest Post Latest Post by sciprog1
Member Avatar for Buffalo101

Hello,

I believe the algorithm you're looking for is Kruskal's Algorithm. Google minimum spanning tree.

Member Avatar for sciprog1

Hello Buffalo,

Thank you for the reply!

Regards,
sciprog1

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.