BackInserterBoolMap< Container, Functor > Class Template Reference
[Map Adaptors]
Detailed Description
template<typename Container, typename Functor = _maps_bits::Identity<typename Container::value_type>>
 class lemon::BackInserterBoolMap< Container, Functor >
Writable bool map for logging each 
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);
- See also:
- StoreBoolMap 
FrontInserterBoolMap  
InserterBoolMap  
#include <lemon/maps.h>
List of all members.
|  | 
| 
 Public Member Functions | 
|  | BackInserterBoolMap (Container &_container, const Functor &_functor=Functor()) | 
|  | Constructor. 
 | 
| void | set (const Key &key, Value value) | 
|  | The setfunction of the map.
 |