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

Subject: Re: [Boost-users] [BGL]Standard Breadth First Visitor
From: Andrew Sutton (andrew.n.sutton_at_[hidden])
Date: 2009-01-06 09:03:41

>
> 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.
>

Which part is causing trouble: the implementation of the visitor or the
creation of a color map? Creating exterior properties can be a bit tricky,
and the method used depends entirely on the type of your graph.

Post code usually results in better answers.

Andrew Sutton
andrew.n.sutton_at_[hidden]