true
assigned element by pushing them into a back insertable container. It can be used to retrieve the items into a standard container. The next example shows how you can store the edges found by the Prim algorithm in a vector.
vector<UEdge> span_tree_uedges; BackInserterBoolMap<vector<UEdge> > inserter_map(span_tree_uedges); prim(ugraph, cost, inserter_map);
#include <lemon/maps.h>
Public Member Functions | |
BackInserterBoolMap (Container &_container, const Functor &_functor=Functor()) | |
Constructor. | |
void | set (const Key &key, Value value) |
The set function of the map. |