issues
search
KevinStern
/
software-and-algorithms
Neat algorithm implementations in Java.
MIT License
118
stars
70
forks
source link
issues
Newest
Newest
Most commented
Recently updated
Oldest
Least commented
Least recently updated
ClosestPointPairAlgorithm: Illegal initial capacity: -1
#16
micycle1
closed
3 years ago
1
Bump junit from 4.10 to 4.13.1
#15
dependabot[bot]
closed
3 years ago
0
a fix for failure to compile with OpenJDK11
#14
ostueker
opened
4 years ago
0
Hi, the implementation returns the pos of least cost , how do I change it to return me the pos of max cost array?
#13
SangeetaSingh
opened
5 years ago
1
remove redundant code
#12
Yay295
opened
6 years ago
0
Updating the maven artifact
#11
adnane-o
opened
6 years ago
0
Add NaN check in Hungarian Algorithm test
#10
didacr
opened
7 years ago
0
Hungarian algorithm doesn't work
#9
tintor
closed
7 years ago
1
Compile and Use with examples
#8
maki-markie
closed
7 years ago
1
One small problem
#7
clauber115
closed
9 years ago
2
labelByWorker Initialization
#6
clauber115
closed
9 years ago
1
DamerauLevenshteinAlgorithm Incorrect?
#5
ghost
closed
10 years ago
1
Error in initializing zeroth row?
#4
fjf2002
closed
10 years ago
3
Change the searching code in DynamicIntervalTree to make it more efficient
#3
Gigatron
closed
11 years ago
6
I have implemented this in C++ but I get distances incremented by 1
#2
brokenthorn
closed
11 years ago
3
added some short circuits to DamerauLevenshteinAlgorithm.execute()
#1
pschichtel
closed
11 years ago
2