1.1 --- a/lemon/planarity.h	Sun Sep 30 19:14:33 2007 +0000
     1.2 +++ b/lemon/planarity.h	Sun Sep 30 19:19:33 2007 +0000
     1.3 @@ -183,11 +183,8 @@
     1.4      /// \brief Runs the algorithm.
     1.5      ///
     1.6      /// Runs the algorithm.  
     1.7 -    /// \param kuratowski If the parameter is false, then the
     1.8 -    /// algorithm does not calculate the isolate Kuratowski
     1.9 -    /// subdivisions.
    1.10      /// \return %True when the graph is planar.
    1.11 -    bool run(bool kuratowski = true) {
    1.12 +    bool run() {
    1.13        typedef _planarity_bits::PlanarityVisitor<UGraph> Visitor;
    1.14  
    1.15        PredMap pred_map(_ugraph, INVALID);
    1.16 @@ -222,7 +219,7 @@
    1.17  	  Node target = _ugraph.target(e);
    1.18  	  
    1.19  	  if (order_map[source] < order_map[target] && tree_map[e]) {
    1.20 -	    initFace(target, node_data, pred_map, order_map, order_list);
    1.21 +	    initFace(target, node_data, order_map, order_list);
    1.22  	  }
    1.23  	}
    1.24  	
    1.25 @@ -492,8 +489,7 @@
    1.26      }
    1.27  
    1.28      void initFace(const Node& node, NodeData& node_data, 
    1.29 -		  const PredMap& pred_map, const OrderMap& order_map, 
    1.30 -		  const OrderList& order_list) {
    1.31 +		  const OrderMap& order_map, const OrderList& order_list) {
    1.32        int n = order_map[node];
    1.33        int rn = n + order_list.size();
    1.34