1.1 --- a/lemon/planarity.h Wed Mar 17 12:35:52 2010 +0100
1.2 +++ b/lemon/planarity.h Sat Mar 06 14:35:12 2010 +0000
1.3 @@ -2,7 +2,7 @@
1.4 *
1.5 * This file is a part of LEMON, a generic C++ optimization library.
1.6 *
1.7 - * Copyright (C) 2003-2009
1.8 + * Copyright (C) 2003-2010
1.9 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
1.10 * (Egervary Research Group on Combinatorial Optimization, EGRES).
1.11 *
1.12 @@ -140,17 +140,17 @@
1.13 template <typename Graph>
1.14 class PlanarityChecking {
1.15 private:
1.16 -
1.17 +
1.18 TEMPLATE_GRAPH_TYPEDEFS(Graph);
1.19
1.20 const Graph& _graph;
1.21
1.22 private:
1.23 -
1.24 +
1.25 typedef typename Graph::template NodeMap<Arc> PredMap;
1.26 -
1.27 +
1.28 typedef typename Graph::template EdgeMap<bool> TreeMap;
1.29 -
1.30 +
1.31 typedef typename Graph::template NodeMap<int> OrderMap;
1.32 typedef std::vector<Node> OrderList;
1.33
1.34 @@ -221,7 +221,7 @@
1.35 }
1.36
1.37 for (typename MergeRoots::Value::iterator it =
1.38 - merge_roots[node].begin();
1.39 + merge_roots[node].begin();
1.40 it != merge_roots[node].end(); ++it) {
1.41 int rn = *it;
1.42 walkDown(rn, i, node_data, order_list, child_lists,
1.43 @@ -432,7 +432,7 @@
1.44 Node ynode = order_list[yn];
1.45
1.46 bool rd;
1.47 - if (!external(xnode, rorder, child_lists,
1.48 + if (!external(xnode, rorder, child_lists,
1.49 ancestor_map, low_map)) {
1.50 rd = true;
1.51 } else if (!external(ynode, rorder, child_lists,