COIN-OR::LEMON - Graph Library

Changeset 2598:71f4bd3a9ae8 in lemon-0.x for lemon/planarity.h


Ignore:
Timestamp:
03/25/08 17:28:06 (16 years ago)
Author:
Balazs Dezso
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@3481
Message:

Minor bug fix

File:
1 edited

Legend:

Unmodified
Added
Removed
  • lemon/planarity.h

    r2553 r2598  
    25502550    /// Returns the color of the node. The values are five or six
    25512551    /// distinct \ref lemon::Color "colors".
    2552     int color(const Node& node) const {
     2552    Color color(const Node& node) const {
    25532553      return _palette[_color_map[node]];
    25542554    }
     
    26652665    ///
    26662666    /// This function calculates a coloring with at most five
    2667     /// colors. The wirst case time complexity of this variant is
     2667    /// colors. The worst case time complexity of this variant is
    26682668    /// quadratic in the size of the graph.
    26692669    template <typename EmbeddingMap>
Note: See TracChangeset for help on using the changeset viewer.