min_tree.h

Go to the documentation of this file. Or view the newest version in sPHENIX GitHub for file min_tree.h

/* This software is distributed under the GNU Lesser General Public License */
//==========================================================================
//
//   min_tree.cpp
//
//==========================================================================
// $Id: min_tree.h,v 1.3 2001/06/21 10:55:08 chris Exp $

#ifndef GTL_MIN_TREE_H
#define GTL_MIN_TREE_H

#include <GTL/GTL.h>
#include <GTL/algorithm.h>
#include <GTL/edge_map.h>
#include <set>

__GTL_BEGIN_NAMESPACE

class min_tree: public algorithm { 

public:

    min_tree ();

    virtual ~min_tree () {};

    int check (graph& g);

    int run (graph& g);
    
    virtual void reset ();

    void set_distances (const edge_map<int>& dist);

    set<edge> get_min_tree();
    
    int get_min_tree_length();
    
private:
    typedef pair<int, node::adj_edges_iterator> TSP_A_VALUE;

    class input_comp {
    public:
        bool operator()(TSP_A_VALUE x, TSP_A_VALUE y)
            { return x.first > y.first;}
    };

    edge_map<int> dist;
    int weight;
    set<edge> tree;
    bool is_set_distances;
};

__GTL_END_NAMESPACE

#endif // GTL_MIN_TREE_H