|
Boost Users : |
Subject: [Boost-users] filtered_graph question
From: Lindley M French (lfrench1_at_[hidden])
Date: 2009-04-27 22:32:24
If I construct a filtered_graph on some underlying graph, and then (either through it or via another interface) modify the underlying graph to change which edges make it through the filter....when is this change reflected?
Do I have to construct another filtered_graph? Or is it immediate? Will it invalidate iterators or anything like that?
I'm just trying to get my head around the conceptual workings here.
Boost-users list run by williamkempf at hotmail.com, kalb at libertysoft.com, bjorn.karlsson at readsoft.com, gregod at cs.rpi.edu, wekempf at cox.net