efischer/BiGpairSEQ
1
0
Fork 0
Code Issues Pull Requests Projects Releases 13 Wiki Activity

change frequency of garbage collection requests

Browse Source
This commit is contained in:
eugenefischer
2025-04-10 20:07:34 -05:00
parent 83eff0d1e7
commit 7744586e79
1 changed files with 14 additions and 6 deletions
Download Patch File Download Diff File Expand all files Collapse all files

20
src/main/java/Simulator.java
View File

@@ -1,3 +1,4 @@
import org.jgrapht.Graphs;
import org.jgrapht.alg.interfaces.MatchingAlgorithm;
import org.jgrapht.alg.matching.MaximumWeightBipartiteMatching;
import org.jgrapht.graph.DefaultWeightedEdge;
@@ -147,15 +148,22 @@ public class Simulator implements GraphModificationFunctions {
vertexLabelValue++;
}
betaVertices.forEach(graph::addVertex);
//add edges
//add edges (best so far)
int edgesAddedCount = 0;
for(Vertex a: alphaVertices) {
Set<Integer> a_wells = a.getRecord().getWells();
for(Vertex b: betaVertices) {
Set<Integer> sharedWells = new HashSet<>(a.getRecord().getWells());
Set<Integer> sharedWells = new HashSet<>(a_wells);
sharedWells.retainAll(b.getRecord().getWells());
double weight = (double) sharedWells.size();
if (weight != 0.0) {
DefaultWeightedEdge edge = graph.addEdge(a, b);
graph.setEdgeWeight(edge, weight);
if (!sharedWells.isEmpty()) {
Graphs.addEdge(graph, a, b, (double) sharedWells.size());
}
edgesAddedCount++;
if (edgesAddedCount % 10000000 == 0) { //collect garbage every 10,000,000 edges
System.out.println(edgesAddedCount + " edges added");
//request garbage collection
System.gc();
System.out.println("Garbage collection requested");
}
}
}