lemon/maps.h
changeset 725 11404088d1a5
parent 724 d8073df341f6
child 726 3fc2a801c39e
equal deleted inserted replaced
42:7b6a52e36e5f 43:ba6ccd20fc59
  1897     ///
  1897     ///
  1898     /// Gives back the inverse of the IdMap.
  1898     /// Gives back the inverse of the IdMap.
  1899     InverseMap inverse() const { return InverseMap(*_graph);}
  1899     InverseMap inverse() const { return InverseMap(*_graph);}
  1900   };
  1900   };
  1901 
  1901 
       
  1902   /// \brief Returns an \c IdMap class.
       
  1903   ///
       
  1904   /// This function just returns an \c IdMap class.
       
  1905   /// \relates IdMap
       
  1906   template <typename K, typename GR>
       
  1907   inline IdMap<GR, K> idMap(const GR& graph) {
       
  1908     return IdMap<GR, K>(graph);
       
  1909   }
  1902 
  1910 
  1903   /// \brief General cross reference graph map type.
  1911   /// \brief General cross reference graph map type.
  1904 
  1912 
  1905   /// This class provides simple invertable graph maps.
  1913   /// This class provides simple invertable graph maps.
  1906   /// It wraps a standard graph map (\c NodeMap, \c ArcMap or \c EdgeMap)
  1914   /// It wraps a standard graph map (\c NodeMap, \c ArcMap or \c EdgeMap)
  2360     const InverseMap inverse() const {
  2368     const InverseMap inverse() const {
  2361       return InverseMap(*this);
  2369       return InverseMap(*this);
  2362     }
  2370     }
  2363   };
  2371   };
  2364 
  2372 
       
  2373   /// \brief Returns a \c RangeIdMap class.
       
  2374   ///
       
  2375   /// This function just returns an \c RangeIdMap class.
       
  2376   /// \relates RangeIdMap
       
  2377   template <typename K, typename GR>
       
  2378   inline RangeIdMap<GR, K> rangeIdMap(const GR& graph) {
       
  2379     return RangeIdMap<GR, K>(graph);
       
  2380   }
       
  2381   
  2365   /// \brief Dynamic iterable \c bool map.
  2382   /// \brief Dynamic iterable \c bool map.
  2366   ///
  2383   ///
  2367   /// This class provides a special graph map type which can store a
  2384   /// This class provides a special graph map type which can store a
  2368   /// \c bool value for graph items (\c Node, \c Arc or \c Edge).
  2385   /// \c bool value for graph items (\c Node, \c Arc or \c Edge).
  2369   /// For both \c true and \c false values it is possible to iterate on
  2386   /// For both \c true and \c false values it is possible to iterate on