graph search algorithm

I have a undirected graph set on a 2D plane.

Imagine the graph looking something like the USA where the edges form
the borders of the states.

I would like to automatically recognise all of the enclosed regions (the
states) by searching the graph and store each state as a subgraph.

How can I search the graph returning only the enclosed regions?

Thanks, any suggestions appreciated.

_______________________________________________
Boost-users mailing list
Boost-users@...
http://lists.boost.org/mailman/listinfo.cgi/boost-users