pagerank algorthim

pagerank

//
// Created by wlp on 2019/6/11.
//

#ifndef PAGERANK_PAGERANK_H
#define PAGERANK_PAGERANK_H
double S[5][5] = {0.0,        1.0 / 2.0, 1.0 / 2.0,  0.0, 1.0 / 2.0,
                  1.0 / 4.0,  0.0,       0.0,        0.0, 0.0,
                  1.0 / 4.0,  0.0,       0.0,        1.0, 1.0 / 2.0,
                  1.0 / 4.0,  1.0 / 2.0, 1.0 / 2.0,  0.0, 0.0,
                  1.0 / 4.0,  0.0,       0.0,        0.0, 0.0};
double G[5][5]; /*套用公式后的google矩阵*/
double a = 0.85;/*阻尼系数*/
int n = 5;/*网页数量*/
/*邻接矩阵*/
double U[5][5]={0.0, 1.0, 1.0, 0.0, 1.0,
                1.0, 0.0, 0.0, 0.0, 0.0,
                1.0, 0.0, 0.0, 1.0, 1.0,
                1.0, 1.0, 1.0, 0.0, 0.0,
                1.0, 0.0, 0.0, 0.0, 0.0};
/*初始的特征向量*/
double q[5][1]={1.0,
                1.0,
                1.0,
                1.0,
                1.0};
double qx[5][1];/*每次计算更新后得到的特征向量*/
#endif //PAGERANK_PAGERANK_H

#include <stdio.h>
#include "pagerank.h"

int main() {
    int i;
    printf("S is:\n"); //输出初始化网络架构
    for (int i = 0; i < 5; ++i) {
        for (int m = 0; m < 5; ++m) {
            printf("%0.6lf ", S[i][m]);
        }
        printf("\n");
    }
    for (int j1 = 0; j1 < 30; ++j1) {    /*每次计算前先reset*/
        for (int s1 = 0; s1 < 5; ++s1) {
            qx[s1][0] = 0.0;
        }
        for (int i = 0; i < 5; ++i) {   //计算特征向量
            for (int j = 0; j < 5; ++j) {
                qx[i][0]+= S[i][j] * q[j][0]+(1-a)/n;
            }
        }
        printf("------------------------------------------\n");
        printf("迭代次数为[%d] is:\n",j1+1);
        for (int i = 0; i <5; ++i) {
           q[i][0]=qx[i][0];
           printf("%0.6lf\n",q[i][0]);
        }
    }
    return 0;
}