COIN-OR::LEMON - Graph Library

Changeset 877:141f9c0db4a3 in lemon-main for lemon/planarity.h


Ignore:
Timestamp:
03/06/10 15:35:12 (14 years ago)
Author:
Alpar Juttner <alpar@…>
Branch:
default
Children:
879:38213abd2911, 931:f112c18bc304
Phase:
public
Message:

Unify the sources (#339)

File:
1 edited

Legend:

Unmodified
Added
Removed
  • lemon/planarity.h

    r828 r877  
    33 * This file is a part of LEMON, a generic C++ optimization library.
    44 *
    5  * Copyright (C) 2003-2009
     5 * Copyright (C) 2003-2010
    66 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
    77 * (Egervary Research Group on Combinatorial Optimization, EGRES).
     
    141141    class PlanarityChecking {
    142142    private:
    143      
     143
    144144      TEMPLATE_GRAPH_TYPEDEFS(Graph);
    145145
     
    147147
    148148    private:
    149      
     149
    150150      typedef typename Graph::template NodeMap<Arc> PredMap;
    151      
     151
    152152      typedef typename Graph::template EdgeMap<bool> TreeMap;
    153      
     153
    154154      typedef typename Graph::template NodeMap<int> OrderMap;
    155155      typedef std::vector<Node> OrderList;
     
    222222
    223223          for (typename MergeRoots::Value::iterator it =
    224                  merge_roots[node].begin(); 
     224                 merge_roots[node].begin();
    225225               it != merge_roots[node].end(); ++it) {
    226226            int rn = *it;
     
    433433
    434434              bool rd;
    435               if (!external(xnode, rorder, child_lists, 
     435              if (!external(xnode, rorder, child_lists,
    436436                            ancestor_map, low_map)) {
    437437                rd = true;
Note: See TracChangeset for help on using the changeset viewer.