1.1 --- a/lemon/planarity.h	Thu Mar 20 16:57:12 2008 +0000
     1.2 +++ b/lemon/planarity.h	Tue Mar 25 16:28:06 2008 +0000
     1.3 @@ -2549,7 +2549,7 @@
     1.4      ///
     1.5      /// Returns the color of the node. The values are five or six
     1.6      /// distinct \ref lemon::Color "colors".
     1.7 -    int color(const Node& node) const {
     1.8 +    Color color(const Node& node) const {
     1.9        return _palette[_color_map[node]];
    1.10      }
    1.11      
    1.12 @@ -2664,7 +2664,7 @@
    1.13      /// \brief Calculates a coloring with at most five colors
    1.14      ///
    1.15      /// This function calculates a coloring with at most five
    1.16 -    /// colors. The wirst case time complexity of this variant is
    1.17 +    /// colors. The worst case time complexity of this variant is
    1.18      /// quadratic in the size of the graph.
    1.19      template <typename EmbeddingMap>
    1.20      void runFiveColoring(const EmbeddingMap& embedding) {