lemon/max_matching.h
changeset 2637 bafe730864da
parent 2553 bfced05fa852
equal deleted inserted replaced
15:d42919bc3c0b 16:690e18780d06
  2851 	_delta4_index->set(i, _delta4->PRE_HEAP);
  2851 	_delta4_index->set(i, _delta4->PRE_HEAP);
  2852       }
  2852       }
  2853 
  2853 
  2854       int index = 0;
  2854       int index = 0;
  2855       for (NodeIt n(_ugraph); n != INVALID; ++n) {
  2855       for (NodeIt n(_ugraph); n != INVALID; ++n) {
  2856 	Value max = std::numeric_limits<Value>::min();
  2856 	Value max = - std::numeric_limits<Value>::max();
  2857 	for (OutEdgeIt e(_ugraph, n); e != INVALID; ++e) {
  2857 	for (OutEdgeIt e(_ugraph, n); e != INVALID; ++e) {
  2858 	  if (_ugraph.target(e) == n) continue;
  2858 	  if (_ugraph.target(e) == n) continue;
  2859 	  if ((dualScale * _weight[e]) / 2 > max) {
  2859 	  if ((dualScale * _weight[e]) / 2 > max) {
  2860 	    max = (dualScale * _weight[e]) / 2;
  2860 	    max = (dualScale * _weight[e]) / 2;
  2861 	  }
  2861 	  }