Changeset 2481:ddb851e1481a in lemon0.x for lemon
 Timestamp:
 09/30/07 21:19:33 (12 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@3320
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

lemon/planarity.h
r2480 r2481 184 184 /// 185 185 /// Runs the algorithm. 186 /// \param kuratowski If the parameter is false, then the187 /// algorithm does not calculate the isolate Kuratowski188 /// subdivisions.189 186 /// \return %True when the graph is planar. 190 bool run( bool kuratowski = true) {187 bool run() { 191 188 typedef _planarity_bits::PlanarityVisitor<UGraph> Visitor; 192 189 … … 223 220 224 221 if (order_map[source] < order_map[target] && tree_map[e]) { 225 initFace(target, node_data, pred_map,order_map, order_list);222 initFace(target, node_data, order_map, order_list); 226 223 } 227 224 } … … 493 490 494 491 void initFace(const Node& node, NodeData& node_data, 495 const PredMap& pred_map, const OrderMap& order_map, 496 const OrderList& order_list) { 492 const OrderMap& order_map, const OrderList& order_list) { 497 493 int n = order_map[node]; 498 494 int rn = n + order_list.size();
Note: See TracChangeset
for help on using the changeset viewer.