Алгоритм PageRank в С

float *calculateRank(GraphT *graph, float d, float diffPR, int maxIterations, int N) {
 
    // float Nf = (float)N;
    float previousRank[N];
    float *pageRank = malloc(sizeof(float) * N);
 
    for (int i = 0; i < N; i++) {
        pageRank[i] = 1 / N;
    }
 
    int iterations = 0;
 
    float diff = diffPR;
 
    float sum = 0;
    float incoming = 0;
    float outgoing = 0;
    float diffSum = 0;
 
    while (iterations < maxIterations && diff >= diffPR) {
 
        iterations++;
        diffSum = 0;
 
        for (int u = 0; u < N; u++) {
            previousRank[u] = pageRank[u]; 
        }
 
        for (int i = 0; i < N; i++) {
            sum = 0;
            
            for (int j = 0; j < N; j++) {
 
                if (adjacent(graph, j, i)) {
 
                    incoming = countIncomingLinks(graph, i) / sumIncomingLinks(graph, j);
                    outgoing = countOutgoingLinks(graph, i) / sumOutgoingLinks(graph, j); 
 
                    sum = sum + (previousRank[i] * incoming * outgoing);
                }
            }
            pageRank[i] = ((1 - d) / N) + (d * sum);
        }
 
        for (int k = 0; k < N; k++) {
            diffSum = diffSum + fabsf(pageRank[k] - previousRank[k]); 
        }
 
        diff = diffSum;
    }
 
    return pageRank; 
}