COIN-OR::LEMON - Graph Library

Ignore:
Timestamp:
10/08/08 11:17:01 (16 years ago)
Author:
Balazs Dezso
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@3509
Message:

Bug fixes is HaoOrlin? and MinCostArborescence?

MinCostArborescence?

  • proper deallocation

HaoOrlin?

  • the target needn't to be the last in its bucket
  • proper size of container (if each node starts in different buckets initially)
File:
1 edited

Legend:

Unmodified
Added
Removed
  • lemon/min_cost_arborescence.h

    r2553 r2624  
    644644        delete _pred;
    645645      }
    646       if (!_edge_order) {
     646      if (_edge_order) {
    647647        delete _edge_order;
    648648      }
     
    650650        delete _node_order;
    651651      }
    652       if (!_cost_edges) {
     652      if (_cost_edges) {
    653653        delete _cost_edges;
    654654      }
    655       if (!_heap) {
     655      if (_heap) {
    656656        delete _heap;
    657657      }
    658       if (!_heap_cross_ref) {
     658      if (_heap_cross_ref) {
    659659        delete _heap_cross_ref;
    660660      }
Note: See TracChangeset for help on using the changeset viewer.