org.neo4j.gds.leiden.InitVolumeTask Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of algo Show documentation
Show all versions of algo Show documentation
Neo4j Graph Data Science :: Algorithms
The newest version!
/*
* Copyright (c) "Neo4j"
* Neo4j Sweden AB [http://neo4j.com]
*
* This file is part of Neo4j.
*
* Neo4j is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see .
*/
package org.neo4j.gds.leiden;
import org.neo4j.gds.api.Graph;
import org.neo4j.gds.collections.ha.HugeDoubleArray;
import org.neo4j.gds.core.utils.partition.Partition;
import java.util.concurrent.atomic.DoubleAdder;
class InitVolumeTask implements Runnable {
private final Partition partition;
private final Graph graph;
private final HugeDoubleArray nodeVolumes;
private final DoubleAdder totalVolume;
InitVolumeTask(
Graph graph,
HugeDoubleArray nodeVolumes,
Partition partition,
DoubleAdder totalVolume
) {
this.graph = graph;
this.nodeVolumes = nodeVolumes;
this.partition = partition;
this.totalVolume = totalVolume;
}
@Override
public void run() {
long startId = partition.startNode();
long endId = startId + partition.nodeCount();
for (long nodeId = startId; nodeId < endId; ++nodeId) {
final long finalNodeId = nodeId;
graph.forEachRelationship(nodeId, 1.0, (s, t, w) -> {
nodeVolumes.addTo(finalNodeId, w);
totalVolume.add(w);
return true;
});
}
}
}
© 2015 - 2025 Weber Informatics LLC | Privacy Policy