parent
74b0ae8b90
commit
9d5e75d688
1 changed files with 18 additions and 2 deletions
20
rank.js
20
rank.js
|
@ -95,31 +95,47 @@ function rankCalc(result, iterations = 10, main = [], domain_mode = false) {
|
||||||
|
|
||||||
let ar = Object.keys(result);
|
let ar = Object.keys(result);
|
||||||
let rf = pr[una];
|
let rf = pr[una];
|
||||||
|
<<<<<<< HEAD
|
||||||
let muna = matrixe[una];
|
let muna = matrixe[una];
|
||||||
let muna2 = matrixf[una];
|
let muna2 = matrixf[una];
|
||||||
|
=======
|
||||||
|
>>>>>>> parent of 1d09b07 (matrix math speedup)
|
||||||
|
|
||||||
for (let unb of ar) {
|
for (let unb of ar) {
|
||||||
let prb = prold[unb];
|
let prb = prold[unb];
|
||||||
|
|
||||||
|
<<<<<<< HEAD
|
||||||
muna[unb] = 0.03;
|
muna[unb] = 0.03;
|
||||||
let munb = muna2[unb];
|
let munb = muna2[unb];
|
||||||
|
|
||||||
if (prb * munb < intv || fnc[unb] == 0) {
|
if (prb * munb < intv || fnc[unb] == 0) {
|
||||||
if (isNaN(munb) || !munb) continue;
|
if (isNaN(munb) || !munb) continue;
|
||||||
pr[una] += prb * munb;
|
pr[una] += prb * munb;
|
||||||
|
=======
|
||||||
|
matrixe[una][unb] = 0.03;
|
||||||
|
|
||||||
|
if (prb * matrixf[una][unb] < intv || fnc[unb] == 0) {
|
||||||
|
let mfb = matrixf[una][unb];
|
||||||
|
if (isNaN(mfb) || !mfb) continue;
|
||||||
|
pr[una] += prb * mfb;
|
||||||
|
>>>>>>> parent of 1d09b07 (matrix math speedup)
|
||||||
continue;
|
continue;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
||||||
for (let unc in result) {
|
for (let unc in result) {
|
||||||
|
<<<<<<< HEAD
|
||||||
let mfc = muna2[unc];
|
let mfc = muna2[unc];
|
||||||
|
=======
|
||||||
|
let mfc = matrixf[una][unc];
|
||||||
|
>>>>>>> parent of 1d09b07 (matrix math speedup)
|
||||||
let mfb = matrixf[unc][unb];
|
let mfb = matrixf[unc][unb];
|
||||||
if (isNaN(mfc) || isNaN(mfb) || !mfc || !mfb) continue;
|
if (isNaN(mfc) || isNaN(mfb) || !mfc || !mfb) continue;
|
||||||
matrixe[una][unb] += mfc * mfb;
|
matrixe[una][unb] += mfc * mfb;
|
||||||
}
|
}
|
||||||
|
|
||||||
msum += munb;
|
msum += matrixe[una][unb];
|
||||||
pr[una] += prb * munb;
|
pr[una] += prb * matrixe[una][unb];
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
Loading…
Reference in a new issue