COIN-OR::LEMON - Graph Library

Changeset 2481:ddb851e1481a in lemon-0.x for lemon


Ignore:
Timestamp:
09/30/07 21:19:33 (12 years ago)
Author:
Balazs Dezso
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@3320
Message:

Avoiding warnings

File:
1 edited

Legend:

Unmodified
Added
Removed
  • lemon/planarity.h

    r2480 r2481  
    184184    ///
    185185    /// Runs the algorithm. 
    186     /// \param kuratowski If the parameter is false, then the
    187     /// algorithm does not calculate the isolate Kuratowski
    188     /// subdivisions.
    189186    /// \return %True when the graph is planar.
    190     bool run(bool kuratowski = true) {
     187    bool run() {
    191188      typedef _planarity_bits::PlanarityVisitor<UGraph> Visitor;
    192189
     
    223220         
    224221          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);
    226223          }
    227224        }
     
    493490
    494491    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) {
    497493      int n = order_map[node];
    498494      int rn = n + order_list.size();
Note: See TracChangeset for help on using the changeset viewer.