biglyderv/bigly-caret
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

sdf

Browse source
This commit is contained in:
biglyderv 2025-02-01 02:23:59 -05:00
parent 25e9e1e6d5
commit f7fc83fc73
1 changed files with 12 additions and 14 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

26
rank.js
View file

@ -16,7 +16,7 @@ function rankCalc(result, iterations = 10, main = [], domain_mode = false) {
frs[unn] = result[unn].followers;
fng[unn] = result[unn].following;
let lf = Object.keys(fng[unn]).length;
if (domain_mode) {
let domains = [];
@ -24,13 +24,13 @@ function rankCalc(result, iterations = 10, main = [], domain_mode = false) {
try {
let a = new URL(x);
domains.push(a.host);
} catch(err) {
} catch (err) {
}
}
domains = [...new Set(domains)];
fnc[unn] = lf / (1+domains.length);
fnc[unn] = lf / (1 + domains.length);
} else {
fnc[unn] = lf;
}
@ -91,7 +91,7 @@ function rankCalc(result, iterations = 10, main = [], domain_mode = false) {
pr[una] += prb * mfb;
continue;
}
for (let unc in result) {
let mfc = matrixf[una][unc];
let mfb = matrixf[unc][unb];
@ -101,11 +101,6 @@ function rankCalc(result, iterations = 10, main = [], domain_mode = false) {
msum += matrixe[una][unb];
pr[una] += prb * matrixe[una][unb];
if (main.indexOf(unb) != -1) {
matrixe[una][unb] *= 1.15;
}
}
}
@ -121,11 +116,14 @@ function rankCalc(result, iterations = 10, main = [], domain_mode = false) {
let ov = Object.keys(pr);
let new_sum = ov.filter(i => !isNaN(pr[i]) && main.indexOf(i) != -1).map(n => pr[n]).reduce((a, b) => a + b, 1e-9);
let new_sum2 = ov.filter(i => !isNaN(pr[i]) && main.indexOf(i) == -1).map(n => pr[n]).reduce((a, b) => a + b, 1e-9);
let new_sum2 = ov.filter(i => !isNaN(pr[i]) && main.indexOf(i) == -1 && i.includes(main[0])).map(n => pr[n]).reduce((a, b) => a + b, 1e-9);
let new_sum3 = ov.filter(i => !isNaN(pr[i]) && main.indexOf(i) == -1 && !i.includes(main[0])).map(n => pr[n]).reduce((a, b) => a + b, 1e-9);
for (let unn in result) {
if (main.indexOf(unn) == -1) {
pr[unn] /= new_sum2 * 2;
if (unn.includes(main) && main.indexOf(unn) == -1) {
pr[unn] /= new_sum2 * 4;
} else if (main.indexOf(unn) == -1) {
pr[unn] /= new_sum3 * 4;
} else {
pr[unn] /= new_sum * 2;
}