density.h

Go to the documentation of this file.

#ifndef DENSITY_H_
#define DENSITY_H_

#include "graph.h"

template <typename graph_t>
class density
{
    public:
        virtual ~density() {};
        
        virtual double operator ()(typename graph_t::edge_name_t win, typename graph_t::edge_name_t wout, lui k) const =0;
};

template <typename graph_t>
class simple_density: public density<graph_t>
{
    public:
        double operator ()(typename graph_t::edge_name_t win,
            typename graph_t::edge_name_t wout, lui k) const
        {
            k = k;  // ?
            double num = win;
            double denom = win + wout + 1;
            return num / denom;
        }
};


template <typename graph_t>
class complex_density: public density<graph_t>
{
    public:
        complex_density(double _lambda): lambda(_lambda) {};

        double operator ()(typename graph_t::edge_name_t win,
            typename graph_t::edge_name_t wout, lui k) const
        {
            if (k <= 1 || (win == 0 && wout == 0))
            {
                return 0;
            }
            double part1 = (1 - lambda) * win/(win + wout);
            double part2 = lambda * win / (k * (k - 1));
            return part1 + part2;
        }

    private:
        double lambda; 
};

template <typename graph_t>
class negative_density: public density<graph_t>
{
    public:
        negative_density(double param):lambda(param) {};
        
        double operator ()(typename graph_t::edge_name_t win,
            typename graph_t::edge_name_t wout, lui k) const
        {
          if (k <= 0)
            {
                return -numeric_limits<double>::max();
            }
            double part1 = (1 - lambda) * (double)((win)-(wout))/(double)k;
            double part2;
          if (k == 1)
            part2 = 1;
          else if (k > 1)
            part2 = lambda * win / (k * (k - 1));
          else
            cerr << "BAD DENSITY ROBOT" << endl;
            //Error
          return part1 + part2;
        }

    private:
        double lambda;
};

void calculate_win_wout(const bidirected_t::graph& g,
        const std::set<bidirected_t::vertex>& s,
        bidirected_t::edge_name_t* win, bidirected_t::edge_name_t* wout);


#endif