As Sheldor the conqueror, you're supposed to conquer the kingdom of Wonder-blunder-berg, which happens to be a collection of cities connected with roads.
Your first plan is to attack cities, which when blocked, splits the kingdom into parts that cannot communicate with each other.
In the above kingdom, the multicolored cities, when removed, disconnect the road network.
How many such vulnerable cities exist in the kingdom?
Clarification: A component is a maximal set of cities such that there is a walk between any two cities of the set. A vulnerable city is a city which when, along with its roads, removed, increases the number of components.
The title is just a title, it has nothing to do with the algorithm you'll need.