lemon-0.x: comparison src/lemon/unionfind.h

equal deleted inserted replaced

-:75e6085764ec
+:f686f688bd95
 return comp;
 }
 /**
-* \brief Insert a new element into the structure.
+* \brief Inserts a new element into the structure.
 *
 * This method inserts a new element into the data structure.
 *
 * It is not required to use this method:
 * if the map given to the constructor was filled
 /**
 * \brief Joining the components of element \e a and element \e b.
 *
 * This is the \e union operation of the Union-Find structure.
-* Joins the component of elemenent \e a and component of
+* Joins the component of element \e a and component of
 * element \e b. If \e a and \e b are in the same component then
 * it returns false otherwise it returns true.
 */
 bool join(T a, T b)
 public:
 UnionFindEnum(MapType& _m) : m(_m) {}
 /**
-* \brief Insert the given element into a new component.
+* \brief Inserts the given element into a new component.
 *
 * This method creates a new component consisting only of the
 * given element.
 */
 m.set(a, ai);
 }
 /**
-* \brief Insert the given element into the component of the others.
+* \brief Inserts the given element into the component of the others.
 *
-* This methods insert the element \e a into the component of the
+* This methods inserts the element \e a into the component of the
 * element \e comp.
 */
 void insert(const T &a, const T &comp) {
 ++clit->size;
 }
 /**
-* \brief Find the leader of the component of the given element.
+* \brief Finds the leader of the component of the given element.
 *
 * The method returns the leader of the component of the given element.
 */
 T find(const T &a) const {
 /**
 * \brief Joining the component of element \e a and element \e b.
 *
 * This is the \e union operation of the Union-Find structure.
-* Joins the component of elemenent \e a and component of
+* Joins the component of element \e a and component of
 * element \e b. If \e a and \e b are in the same component then
 * returns false else returns true.
 */
 bool join(T a, T b) {
 return _find(m[a])->size;
 }
 /**
-* \brief Split up the component of the element.
+* \brief Splits up the component of the element.
 *
 * Splitting the component of the element into sigleton
 * components (component of size one).
 */
 return;
 }
 /**
-* \brief Set the given element to the leader element of its component.
+* \brief Sets the given element to the leader element of its component.
 *
-* Set the given element to the leader element of its component.
+* Sets the given element to the leader element of its component.
 */
 void makeRep(const T &a) {
 IIter ia = m[a];
 ia->parent = ia;
 la->parent = ia;
 }
 /**
-* \brief Move the given element to an other component.
+* \brief Moves the given element to an other component.
 *
 * This method moves the element \e a from its component
 * to the component of \e comp.
 * If \e a and \e comp are in the same component then
 * it returns false otherwise it returns true.
 return true;
 }
 /**
-* \brief Remove the given element from the structure.
+* \brief Removes the given element from the structure.
 *
-* Remove the given element from the structure.
+* Removes the given element from the structure.
 *
 * Removes the element from its component and if the component becomes
 * empty then removes that component from the component list.
 */
 void erase(const T &a) {

changeset 1339	26a88d12d1a6
parent 1164	80bb73097736
child 1359	1581f961cfaa