Have a look at
LEMON, the docs are only a couple of html pages (and sufficient), and you'll get the hang of it quite quickly (not a book to read, as with BGL). To do your sweep, mark, delete, just add temporarily a map of bools to your graph. DFS or BFS is given as an algo, finding connected components as well... And did I forget too say it's magnitudes faster than BGL? Well it is...
Get the source from the repo listed as it's got some changes you might want/need not included in the "stable" download... Oh, and a vertex is called a node in LEMON (not that it matters, but since you didn't seem to like that)... Look at
typedef too: typedef Vertex Node; and so ;-) !