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

fix typo

Browse Source
This commit is contained in:
eugenefischer
2022-09-25 17:47:07 -05:00
parent 8a77d53f1f
commit 740835f814
2 changed files with 3 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
readme.md
View File

@@ -281,7 +281,7 @@ with different filtering options), the actual elapsed time was greater. File I/O
slightly less time than the simulation itself. Real elapsed time from start to finish was under 30 minutes. slightly less time than the simulation itself. Real elapsed time from start to finish was under 30 minutes.
As mentioned in the theory section, performance could be improved by implementing a more efficient algorithm for finding As mentioned in the theory section, performance could be improved by implementing a more efficient algorithm for finding
the maximum weighted matching. the maximum weight matching.
## BEHAVIOR WITH RANDOMIZED WELL POPULATIONS ## BEHAVIOR WITH RANDOMIZED WELL POPULATIONS

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

@@ -179,9 +179,9 @@ public class Simulator implements GraphModificationFunctions {
if(verbose){System.out.println("Edges between vertices of with excessively different occupancy values " + if(verbose){System.out.println("Edges between vertices of with excessively different occupancy values " +
"removed");} "removed");}
//Find Maximum Weighted Matching //Find Maximum Weight Matching
//using jheaps library class PairingHeap for improved efficiency //using jheaps library class PairingHeap for improved efficiency
if(verbose){System.out.println("Finding maximum weighted matching");} if(verbose){System.out.println("Finding maximum weight matching");}
MaximumWeightBipartiteMatching maxWeightMatching; MaximumWeightBipartiteMatching maxWeightMatching;
//Use correct heap type for priority queue //Use correct heap type for priority queue
String heapType = BiGpairSEQ.getPriorityQueueHeapType(); String heapType = BiGpairSEQ.getPriorityQueueHeapType();