Re: [Boost-Users] BGL: Loops in undirected graph

From: Tarjei Knapstad (tarjeik_at_[hidden])
Date: 2002-08-19 14:41:44

On Mon, 2002-08-19 at 19:02, Jeremy Siek wrote:
> 
> I've added a new function, undirected_dfs, that treats tree and back
> edgess properly. The function takes one more parameter than the
> depth_first_search function: an edge color map.
> 
Just about done implementing it myself in accordance with your initial
suggestion :)

Thanks (once again) for helping a graph novice out Jeremy.

-- 
Tarjei Knapstad