graph.h

#ifndef __GRAPH_H__
#define __GRAPH_H__

#include "mylib.h"
#include "config.h"

class Graph {
public:

    vector<vector<int>> g;
    vector<vector<int>> gr;
    vector<int> outdegrees;
    string data_folder;

    //vector<double> global_ppr;

    // node rank[100] = 0, means node 100 has first rank
    //vector<int> node_rank;
    // node_score[0]
    //vector<double> node_score;

    //node order 0 = [100, 34.5], most important node is 100 with score 34.5
    //vector<pair<int, double>> node_order;
    //vector<int> loc;


    // the tele ratio for random walk
    //double alpha;

    static bool cmp(const pair<int, double> &t1, const pair<int, double> &t2) {
        return t1.second > t2.second;
    }

    int n;
    long long m;
    long long maxid;

    Graph(string data_folder) {
        INFO("sub constructor");
        this->data_folder = data_folder;
        //this->alpha = ALPHA_DEFAULT;
        if(config.action != GEN_SS_QUERY)
            init_graph();
        else
            init_nm();
        init_outdegree();
        cout << "init graph n: " << this->n << " m: " << this->m << endl;
    }

    void init_nm() {
        string attribute_file = data_folder + FILESEP + "attribute.txt";
        assert_file_exist("attribute file", attribute_file);
        ifstream attr(attribute_file);
        string line1, line2;
        char c;
        while (true) {
            attr >> c;
            if (c == '=') break;
        }
        attr >> n;
        while (true) {
            attr >> c;
            if (c == '=') break;
        }
        attr >> m;
    }
    
    void init_outdegree() {
        outdegrees.resize(n);
        for(int i = 0; i < g.size(); i++){
           outdegrees[i] = g[i].size();
        }
    }

    void init_nm_convert(){
        string attribute_file = data_folder + FILESEP + "attribute.txt";
        assert_file_exist("attribute file", attribute_file);
        ifstream attr(attribute_file);
        string line1, line2;
        char c;
        while (true) {
            attr >> c;
            if (c == '=') break;
        }
        attr >> n;
        while (true) {
            attr >> c;
            if (c == '=') break;
        }
        attr >> m;
        while(true){
            attr >> c;
            if (c == '=') break;
        }
        attr >> maxid;
    }

    void init_graph() {
        if(config.remap)
            init_nm_convert();
        else
            init_nm();
        

        g = vector<vector<int>>(n, vector<int>());
        gr = vector<vector<int>>(n, vector<int>());
        string graph_file = data_folder + FILESEP + "graph.txt";
        assert_file_exist("graph file", graph_file);



        if(config.remap){
            int* idmap = new int[maxid];
            int* degree = new int[n];
            for(long long i =0; i<maxid; i++){
                idmap[i] = -1;
            }
            for(int i=0; i<n;  i++){
                degree[i] = 0;
            }
            int startid = 0;
            long long t1, t2;

            FILE *fin = fopen(graph_file.c_str(), "r");
            while (fscanf(fin, "%d%d", &t1, &t2) != EOF) {
                if(idmap[t1] <0){
                    idmap[t1] = startid;
                    degree[startid]++;
                    startid++;
                }else{
                    degree[idmap[t1]]++;
                }
                if(idmap[t2] < 0){
                    idmap[t2] = startid;
                    startid++;
                }
                if(t1 == t2) continue;
            }

            fclose(fin);
            for(int i=0; i< n; i++){
                g[i].reserve(degree[i]);
            }

            FILE *fin2 = fopen(graph_file.c_str(), "r");

            while (fscanf(fin2, "%d%d", &t1, &t2) != EOF) {
                assert(idmap[t1] < n && idmap[t1] >= 0);
                assert(idmap[t2]< n && idmap[t2] >= 0);

                if(t1 == t2) continue;
                g[idmap[t1]].push_back(idmap[t2]);
                //gr[idmap[t2]].push_back(idmap[t1]);
            }

            fclose(fin2);

            delete [] idmap;
            delete [] degree;
        }else{
            FILE *fin = fopen(graph_file.c_str(), "r");
            int t1, t2;
            while (fscanf(fin, "%d%d", &t1, &t2) != EOF) {
                assert(t1 < n);
                assert(t2 < n);
                if(t1 == t2) continue;
                g[t1].push_back(t2);
                g[t2].push_back(t1);
                gr[t2].push_back(t1);
                gr[t1].push_back(t2);
            }
        }
    }

    double get_avg_degree() const {
        return double(m) / double(n);
    }

};



static void init_parameter(Config &config, const Graph &graph) {
    // init the bwd delta, fwd delta etc

    INFO("init parameters", graph.n);
    config.delta = 1.0 / graph.n;
    config.pfail = 1.0 / graph.n; 

    config.dbar = double(graph.m) / double(graph.n); // average degree


}



#endif