RhodeCode

// Modified for use in LEMON.

// We should really consider using Boost...

//

  /// the used items are small integer numbers.

  ///Convert the \c Value of a map to another type.

    /// \param k The key

    /// \return The target of the arc 

  ///This \c concepts::ReadMap "read only map" returns the simple

  ///Shift a map with a constant.

  ///Scales a maps with a constant.

  ///Negative value of a map

  ///\bug We need a unified way to handle the situation below:

  ///\code

  ///  struct _UnConvertible {};

  ///  template<class A> inline A t_abs(A a) {return _UnConvertible();}

  ///  template<> inline int t_abs<>(int n) {return abs(n);}

  ///  template<> inline long int t_abs<>(long int n) {return labs(n);}

  ///  template<> inline long long int t_abs<>(long long int n) {return ::llabs(n);}

  ///  template<> inline float t_abs<>(float n) {return fabsf(n);}

  ///  template<> inline double t_abs<>(double n) {return fabs(n);}

  ///  template<> inline long double t_abs<>(long double n) {return fabsl(n);}

  ///\endcode

  ///Logical 'not' of a map with writing possibility

  /// \brief Writable bool map for store each true assigned elements.

  /// Writable bool map to store each true assigned elements. It will

  /// The next example shows how can you write the nodes directly

    /// Gives back the given iterator set for the first time.

    /// Gives back the iterator after the last set operation.

  /// \brief Writable bool map for store each true assigned elements in 

  /// a back insertable container.

  /// Writable bool map for store each true assigned elements in a back 

  /// insertable container. It will push back all the keys set to true into

  /// the container. It can be used to retrieve the items into a standard

  /// container. The next example shows how can you store the undirected

  /// arcs in a vector with prim algorithm.

  /// \brief Writable bool map for store each true assigned elements in 

  /// Writable bool map for store each true assigned elements in a front 

  /// \brief Writable bool map for store each true assigned elements in 

  /// Writable bool map for store each true assigned elements in an 

  /// the container. If you want to store the cut arcs of the strongly

  /// The next code finds the connected components of the undirected digraph

    /// Setter function of the map

  /// \brief Writable bool map which stores for each true assigned elements  

  /// the setting order number.

  ///

  /// the setting order number. It make easy to calculate the leaving

  /// The discovering order can be stored a little harder because the

  /// order map is not readable. Now we should use the fork map: