diff -r eecaeab41472 -r ddb851e1481a lemon/planarity.h
--- a/lemon/planarity.h	Sun Sep 30 19:14:33 2007 +0000
+++ b/lemon/planarity.h	Sun Sep 30 19:19:33 2007 +0000
@@ -183,11 +183,8 @@
     /// \brief Runs the algorithm.
     ///
     /// Runs the algorithm.  
-    /// \param kuratowski If the parameter is false, then the
-    /// algorithm does not calculate the isolate Kuratowski
-    /// subdivisions.
     /// \return %True when the graph is planar.
-    bool run(bool kuratowski = true) {
+    bool run() {
       typedef _planarity_bits::PlanarityVisitor<UGraph> Visitor;
 
       PredMap pred_map(_ugraph, INVALID);
@@ -222,7 +219,7 @@
 	  Node target = _ugraph.target(e);
 	  
 	  if (order_map[source] < order_map[target] && tree_map[e]) {
-	    initFace(target, node_data, pred_map, order_map, order_list);
+	    initFace(target, node_data, order_map, order_list);
 	  }
 	}
 	
@@ -492,8 +489,7 @@
     }
 
     void initFace(const Node& node, NodeData& node_data, 
-		  const PredMap& pred_map, const OrderMap& order_map, 
-		  const OrderList& order_list) {
+		  const OrderMap& order_map, const OrderList& order_list) {
       int n = order_map[node];
       int rn = n + order_list.size();