Hi, I think I have finally fixed the maximum adjacency search... Since the last post: - All parameters other than the graph are available as named parameters - Visitor is now pass-by-value - Documentation written Still potential to-do: - Update documentation with graphical walkthrough on a small graph - Python interface? - Find a way to make the priority queue work without unwrap_ref() - Do not depend on one_bit_color_map internals in min_cut_mas_visitor - Other suggestions from Boost community -- Thanks, Fernando Vilas fvilas@iname.com