[Lemon-commits] deba: r3321 - lemon/trunk/lemon
Lemon SVN
svn at lemon.cs.elte.hu
Sun Sep 30 21:19:57 CEST 2007
Author: deba
Date: Sun Sep 30 21:19:33 2007
New Revision: 3321
Modified:
lemon/trunk/lemon/planarity.h
Log:
Avoiding warnings
Modified: lemon/trunk/lemon/planarity.h
==============================================================================
--- lemon/trunk/lemon/planarity.h (original)
+++ lemon/trunk/lemon/planarity.h Sun Sep 30 21:19:33 2007
@@ -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();
More information about the Lemon-commits
mailing list