Hi all. I noticed the following comment on file push_relabel_max_flow.hpp: // This is a breadth-first search over the residual graph // (well, actually the reverse of the residual graph). // Would be cool to have a graph view adaptor for hiding certain // edges, like the saturated (non-residual) edges in this case. This comment is on top of function global_distance_update(), which actually implements the bfs mentioned above. Is there a particular reason for not filtering the graph (with filtered_graph) and avoiding the saturated edges? (Instead of reimplementing bfs.) Also, addition to the active and inactive lists could be done with a visitor. Thanks, Leandro.