This week's book giveaway is in the Kotlin forum.
We're giving away four copies of Kotlin in Action and have Dmitry Jemerov & Svetlana Isakova on-line!
See this thread for details.
Win a copy of Kotlin in Action this week in the Kotlin forum!
  • Post Reply Bookmark Topic Watch Topic
  • New Topic

How to find a cut vertex in a graph?  RSS feed

 
Seetharaman Venkatasamy
Ranch Hand
Posts: 5575
Eclipse IDE Java Windows XP
  • Mark post as helpful
  • send pies
  • Quote
  • Report post to moderator
currently I am on a data structure book called data structure and algorithms made easy in java, in that book(page 291), there is a discussion about finding cut vertexes in a given graph. but I have hard time to understand the concept. even I google about it and try to figure out. but not able to understand.. already I wasted 2 days on it... any body has idea about it? if yes, could you please explain?

Note: I understand the definition about cut vertex
 
Seetharaman Venkatasamy
Ranch Hand
Posts: 5575
Eclipse IDE Java Windows XP
  • Mark post as helpful
  • send pies
  • Quote
  • Report post to moderator
Yes!!! finally I have cracked it ... nice logic ;)
 
  • Post Reply Bookmark Topic Watch Topic
  • New Topic
Boost this thread!