[boost] Update on maximum adjacency search implementation

Subject: [boost] Update on maximum adjacency search implementation
From: Fernando Vilas (fvilas_at_[hidden])
Date: 2012-02-20 23:21:08

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_at_[hidden]