# Changeset 767:6e8c27ee9079 in lemon for lemon/maps.h

Ignore:
Timestamp:
07/23/09 18:13:59 (12 years ago)
Branch:
default
Phase:
public
Message:

Improvements for graph maps (#302)

File:
1 edited

Unmodified
Added
Removed
• ## lemon/maps.h

 r731 /// the items stored in the graph, which is returned by the \c id() /// function of the graph. This map can be inverted with its member /// class \c InverseMap or with the \c operator() member. /// class \c InverseMap or with the \c operator()() member. /// /// \tparam GR The graph type. typename Container::const_iterator it = _inv_map.find(val); return it != _inv_map.end() ? it->second : INVALID; } /// \brief Returns the number of items with the given value. /// /// This function returns the number of items with the given value /// associated with it. int count(const Value &val) const { return _inv_map.count(val); } }; /// \brief Provides continuous and unique ID for the /// \brief Provides continuous and unique id for the /// items of a graph. /// /// RangeIdMap provides a unique and continuous /// ID for each item of a given type (\c Node, \c Arc or /// id for each item of a given type (\c Node, \c Arc or /// \c Edge) in a graph. This id is ///  - \b unique: different items get different ids, /// the \c id() function of the graph or \ref IdMap. /// This map can be inverted with its member class \c InverseMap, /// or with the \c operator() member. /// or with the \c operator()() member. /// /// \tparam GR The graph type.
Note: See TracChangeset for help on using the changeset viewer.