[Boost-users] [BGL]Standard Breadth First Visitor

Hello everyone, I can't seem to wrap my head around implementing a BFS Visitor and color map required by the breadth_first_visitor function. I want to use it to find connected parts of a graph and after the algorithm has run I plan to clear all white nodes. If anyone could provide me with a code example or link to one implementing really only default behaviour I'd appreciate it immensely. Have a happy new year, Moritz