// Weight object itself positively.
F.set(i, i, 1.0);
final int nweight = -1 / neighborhood.size();
// We need to find the index positions of the neighbors, unfortunately.
for(DBID nid : neighborhood) {
int pos = ids.binarySearch(nid);
assert (pos >= 0);
F.set(pos, i, nweight);
}
}
}