COIN-OR::LEMON - Graph Library

Changeset 581:aa1804409f29 in lemon-1.2 for lemon/min_cost_arborescence.h


Ignore:
Timestamp:
04/14/09 10:35:38 (11 years ago)
Author:
Peter Kovacs <kpeter@…>
Branch:
default
Phase:
public
Message:

Exploit that the standard maps are reference maps (#190)

File:
1 edited

Legend:

Unmodified
Added
Removed
  • lemon/min_cost_arborescence.h

    r559 r581  
    294294        }
    295295      }
    296       _arc_order->set(minimum.arc, _dual_variables.size());
     296      (*_arc_order)[minimum.arc] = _dual_variables.size();
    297297      DualVariable var(_dual_node_list.size() - 1,
    298298                       _dual_node_list.size(), minimum.value);
     
    336336        }
    337337      }
    338       _arc_order->set(minimum.arc, _dual_variables.size());
     338      (*_arc_order)[minimum.arc] = _dual_variables.size();
    339339      DualVariable var(node_bottom, _dual_node_list.size(), minimum.value);
    340340      _dual_variables.push_back(var);
     
    365365        Node source = _heap->top();
    366366        _heap->pop();
    367         _node_order->set(source, -1);
     367        (*_node_order)[source] = -1;
    368368        for (OutArcIt it(*_digraph, source); it != INVALID; ++it) {
    369369          if ((*_arc_order)[it] < 0) continue;
     
    651651      for (NodeIt it(*_digraph); it != INVALID; ++it) {
    652652        (*_cost_arcs)[it].arc = INVALID;
    653         _node_order->set(it, -3);
    654         _heap_cross_ref->set(it, Heap::PRE_HEAP);
     653        (*_node_order)[it] = -3;
     654        (*_heap_cross_ref)[it] = Heap::PRE_HEAP;
    655655        _pred->set(it, INVALID);
    656656      }
    657657      for (ArcIt it(*_digraph); it != INVALID; ++it) {
    658658        _arborescence->set(it, false);
    659         _arc_order->set(it, -1);
     659        (*_arc_order)[it] = -1;
    660660      }
    661661      _dual_node_list.clear();
Note: See TracChangeset for help on using the changeset viewer.