Top 20 Problems and Implementation hits

This page reports the 20 most popular algorithm implementations and problemsfor each month since Febuary 1998, asmeasured by the number of distinct hits to the cooresponding pages of the Stony Brook Algorithm Repository.Cumulative rankings all of implementation and problem hits are also available.

We provide this as a mechanism to help you identify the most popular (and presumably useful) parts of the repository.Clicking on the implementation or algorithm name takes you to the appropriate page. To track changes in therelative popularity of each problem, click on any hit count to see a graph of the number of hits per month for thatpage.

Our paper ``Who is Interested in Algorithms and Why?, which carefully analyzes one year's worth of hits tothe Algorithm Repository, is available in both HTML and postscript.It was published in ACM SIGACT News after a preliminary versionappeared in the Second Workshop on Algorithm Engineering.

Aug2000 Jul2000 Jun2000 May2000 Apr2000 Mar2000 Feb2000 Jan2000 Dec1999 Nov1999 Oct1999 Sep1999 Aug1999 Jul1999 Jun1999 May1999 Apr1999 Mar1999 Feb1999 Jan1999 Dec1998 Nov1998 Oct1998 Sep1998 Aug1998 Jul1998 Jun1998 May1998 Apr1998 Mar1998 Feb1998

Statistics for Aug,2000

Implementation	Hits	Problems	Hits
LEDA	251	dictionaries	164
sedgewick	135	shortest-path	161
handbook	132	suffix-trees	132
syslo	89	priority-queues	132
xtango	86	graph-data-structures	129
graphed	85	finite-state-minimization	128
graphbase	67	sorting	127
goldberg	67	graph-isomorphism	127
ranger	63	generating-permutations	123
random-numbers	63	traveling-salesman	117
toms	60	knapsack	117
combinatorica	58	minimum-spanning-tree	114
moret	55	random-numbers	111
ANN	55	kd-trees	110
nauty	54	transitive-closure	108
tsp	50	string-matching	101
lpsolve	50	unconstrained-optimization	99
CONVEX-HULL-JAVA	50	nearest-neighbor	94
stony	48	longest-common-substring	94
orourke	45	convex-hull	93

Statistics for Jul,2000

Implementation	Hits		Problems	Hits

Statistics for Jun,2000

Implementation	Hits		Problems	Hits

Statistics for May,2000

Implementation	Hits		Problems	Hits

Statistics for Apr,2000

Implementation	Hits	Problems	Hits
LEDA	578	shortest-path	432
sedgewick	412	traveling-salesman	321
handbook	242	graph-data-structures	312
xtango	241	sorting	311
graphbase	217	minimum-spanning-tree	287
syslo	178	dictionaries	281
goldberg	171	generating-permutations	239
graphed	155	suffix-trees	200
toms	132	knapsack	199
lpsolve	129	priority-queues	190
combinatorica	118	network-flow	189
tsp	117	kd-trees	189
ranger	97	string-matching	179
stony	94	set-data-structures	179
fortune	89	topological-sorting	172
ANN	89	eulerian-cycle	170
moret	85	random-numbers	166
chinese-postman	85	bin-packing	161
wilf	81	transitive-closure	153
nauty	78	matching	150

Statistics for Mar,2000

Implementation	Hits	Problems	Hits
LEDA	906	graph-data-structures	633
sedgewick	621	shortest-path	596
handbook	541	dictionaries	562
graphbase	275	sorting	464
combinatorica	272	kd-trees	432
xtango	271	traveling-salesman	416
goldberg	247	suffix-trees	360
syslo	244	triangulations	354
ranger	212	minimum-spanning-tree	346
tsp	211	generating-permutations	304
lpsolve	187	priority-queues	300
triangle	184	random-numbers	275
toms	182	topological-sorting	268
stony	166	nearest-neighbor	256
graphed	159	string-matching	255
moret	139	convex-hull	237
ANN	123	knapsack	228
wilf	118	linear-programming	225
grail	117	linear-equations	224
orourke	113	eulerian-cycle	208

Statistics for Feb,2000

Implementation	Hits	Problems	Hits
LEDA	1175	shortest-path	752
sedgewick	901	dictionaries	705
xtango	597	sorting	694
handbook	568	traveling-salesman	621
syslo	373	graph-data-structures	497
goldberg	370	suffix-trees	478
graphbase	365	minimum-spanning-tree	461
lpsolve	346	priority-queues	438
graphed	316	kd-trees	434
combinatorica	294	generating-permutations	429
toms	289	convex-hull	421
tsp	255	random-numbers	412
ranger	225	knapsack	407
wilf	217	string-matching	406
watson	212	triangulations	375
ruskey	208	linear-equations	360
fortune	206	linear-programming	350
grail	203	network-flow	344
stony	202	nearest-neighbor	340
moret	191	topological-sorting	335

Statistics for Jan,2000

Implementation	Hits	Problems	Hits
LEDA	2313	shortest-path	1017
sedgewick	1019	graph-data-structures	972
handbook	756	dictionaries	960
xtango	711	sorting	810
goldberg	628	traveling-salesman	708
syslo	497	dfs-bfs	626
graphbase	486	string-matching	615
graphed	436	random-numbers	545
combinatorica	389	approximate-pattern-matching	525
toms	355	minimum-spanning-tree	523
reingold	330	kd-trees	520
lpsolve	323	suffix-trees	519
tsp	314	priority-queues	518
moret	295	generating-permutations	486
ranger	278	network-flow	425
watson	264	matching	417
stony	259	convex-hull	414
ANN	256	set-data-structures	411
wilf	239	nearest-neighbor	409
bipm	235	topological-sorting	394

Statistics for Dec,1999

Implementation	Hits	Problems	Hits
LEDA	1380	shortest-path	827
sedgewick	945	dictionaries	742
handbook	625	sorting	741
xtango	559	traveling-salesman	644
graphbase	431	graph-data-structures	631
goldberg	378	minimum-spanning-tree	528
syslo	377	suffix-trees	480
combinatorica	350	string-matching	469
lpsolve	314	priority-queues	435
graphed	312	kd-trees	433
tsp	296	generating-permutations	412
toms	288	random-numbers	367
ranger	249	knapsack	361
moret	248	nearest-neighbor	349
stony	213	topological-sorting	329
watson	211	set-data-structures	317
wilf	204	convex-hull	317
weisses	203	network-flow	315
reingold	196	approximate-pattern-matching	305
simpack	195	clique	294

Statistics for Nov,1999

Implementation	Hits	Problems	Hits
LEDA	1715	shortest-path	987
sedgewick	1247	sorting	887
handbook	824	dictionaries	844
xtango	666	traveling-salesman	787
graphbase	592	minimum-spanning-tree	763
syslo	471	graph-data-structures	702
goldberg	447	suffix-trees	630
graphed	443	priority-queues	617
combinatorica	396	kd-trees	506
toms	385	knapsack	456
tsp	362	network-flow	455
stony	344	string-matching	452
ranger	333	random-numbers	449
lpsolve	328	topological-sorting	433
moret	314	matching	411
orourke	264	hamiltonian-cycle	403
simpack	253	linear-programming	392
ANN	242	set-data-structures	386
wilf	233	convex-hull	384
ruskey	227	generating-permutations	376

Statistics for Oct,1999

Implementation	Hits	Problems	Hits
LEDA	364	shortest-path	205
sedgewick	238	sorting	176
handbook	161	traveling-salesman	175
graphbase	153	dictionaries	159
graphed	120	minimum-spanning-tree	158
xtango	116	graph-data-structures	154
combinatorica	108	network-flow	118
goldberg	104	suffix-trees	117
syslo	103	kd-trees	117
toms	102	knapsack	107
ranger	86	priority-queues	100
moret	74	random-numbers	97
tsp	67	nearest-neighbor	93
ANN	59	generating-permutations	93
orourke	58	linear-programming	87
simpack	54	convex-hull	86
reingold	53	string-matching	81
nauty	53	voronoi-diagrams	80
stony	49	approximate-pattern-matching	79
wilf	46	longest-common-substring	78

Statistics for Sep,1999

Implementation	Hits	Problems	Hits
LEDA	803	shortest-path	480
sedgewick	562	sorting	441
handbook	492	bin-packing	412
xtango	344	traveling-salesman	354
syslo	291	dictionaries	342
graphbase	275	graph-data-structures	276
combinatorica	238	generating-permutations	267
toms	235	minimum-spanning-tree	250
goldberg	231	suffix-trees	246
ranger	229	string-matching	239
graphed	195	kd-trees	229
moret	179	nearest-neighbor	221
tsp	176	priority-queues	216
orourke	175	knapsack	204
watson	161	random-numbers	199
lpsolve	156	network-flow	199
ruskey	152	finite-state-minimization	199
reingold	151	convex-hull	195
stony	143	intersection-detection	192
grail	143	geometric-primitives	191

Statistics for Aug,1999

Implementation	Hits	Problems	Hits
LEDA	768	shortest-path	388
sedgewick	553	traveling-salesman	327
handbook	442	dictionaries	316
grail	322	sorting	311
xtango	289	graph-data-structures	309
graphbase	280	kd-trees	270
ranger	244	nearest-neighbor	257
goldberg	232	intersection-detection	244
syslo	221	minimum-spanning-tree	240
combinatorica	219	string-matching	229
toms	218	voronoi-diagrams	225
graphed	216	priority-queues	217
orourke	205	finite-state-minimization	214
lpsolve	193	triangulations	211
moret	180	generating-permutations	210
tsp	163	convex-hull	210
ANN	161	geometric-primitives	208
reingold	153	suffix-trees	205
ruskey	137	topological-sorting	187
watson	133	network-flow	181

Statistics for Jul,1999

Implementation	Hits	Problems	Hits
LEDA	939	traveling-salesman	488
sedgewick	483	shortest-path	483
handbook	411	dictionaries	326
xtango	332	minimum-spanning-tree	324
syslo	325	graph-data-structures	314
graphbase	322	kd-trees	295
toms	270	nearest-neighbor	291
ranger	270	sorting	290
combinatorica	264	voronoi-diagrams	258
moret	251	triangulations	253
goldberg	226	string-matching	248
orourke	209	convex-hull	244
graphed	206	priority-queues	241
tsp	184	suffix-trees	227
reingold	164	knapsack	224
grail	158	network-flow	216
ANN	156	hamiltonian-cycle	206
wilf	146	generating-permutations	196
watson	139	finite-state-minimization	196
chinese-postman	139	intersection-detection	195

Statistics for Jun,1999

Implementation	Hits	Problems	Hits
LEDA	1092	shortest-path	621
sedgewick	757	traveling-salesman	480
handbook	567	sorting	402
syslo	439	minimum-spanning-tree	379
xtango	413	string-matching	339
graphbase	367	kd-trees	330
ranger	332	graph-data-structures	330
goldberg	313	dictionaries	329
orourke	308	triangulations	327
toms	298	priority-queues	291
combinatorica	296	nearest-neighbor	289
graphed	271	suffix-trees	270
tsp	251	approximate-pattern-matching	267
moret	233	knapsack	259
watson	197	voronoi-diagrams	247
eppstein	195	convex-hull	246
wilf	180	topological-sorting	243
lpsolve	171	network-flow	238
fortune	158	generating-permutations	236
simpack	148	intersection-detection	225

Statistics for May,1999

Implementation	Hits	Problems	Hits
LEDA	1332	shortest-path	780
sedgewick	865	traveling-salesman	579
xtango	582	sorting	485
syslo	528	minimum-spanning-tree	473
handbook	525	graph-data-structures	460
combinatorica	495	dictionaries	385
graphbase	489	vertex-coloring	384
goldberg	379	topological-sorting	358
ranger	329	string-matching	338
toms	310	kd-trees	335
graphed	300	network-flow	303
orourke	271	triangulations	281
tsp	259	priority-queues	278
moret	237	hamiltonian-cycle	277
wilf	233	suffix-trees	270
reingold	209	knapsack	266
trick	205	convex-hull	265
stony	195	matching	261
watson	190	nearest-neighbor	258
eppstein	175	generating-permutations	250

Statistics for Apr,1999

Implementation	Hits	Problems	Hits
LEDA	1343	shortest-path	777
sedgewick	816	traveling-salesman	504
handbook	540	graph-data-structures	500
graphbase	495	sorting	445
xtango	478	minimum-spanning-tree	408
goldberg	420	string-matching	362
combinatorica	366	dictionaries	359
syslo	351	priority-queues	337
toms	320	kd-trees	320
graphed	312	convex-hull	313
ranger	290	topological-sorting	301
tsp	239	vertex-coloring	288
orourke	233	triangulations	274
stony	214	suffix-trees	274
moret	214	network-flow	272
simpack	188	generating-graphs	272
watson	181	random-numbers	239
trick	160	knapsack	238
lpsolve	157	set-data-structures	237
dimacs	154	nearest-neighbor	236

Statistics for Mar,1999

Implementation	Hits	Problems	Hits
LEDA	1187	shortest-path	565
sedgewick	621	traveling-salesman	448
handbook	536	priority-queues	363
xtango	398	graph-data-structures	362
combinatorica	387	kd-trees	355
ranger	351	dictionaries	354
graphbase	347	minimum-spanning-tree	343
syslo	345	sorting	337
goldberg	307	string-matching	305
toms	274	suffix-trees	299
orourke	237	network-flow	287
moret	237	knapsack	256
graphed	224	nearest-neighbor	251
simpack	212	random-numbers	232
stony	207	convex-hull	231
reingold	197	triangulations	228
tsp	187	matching	223
eppstein	168	intersection-detection	219
wilf	154	dfs-bfs	217
ruskey	149	geometric-primitives	209

Statistics for Feb,1999

Implementation	Hits	Problems	Hits
LEDA	876	kd-trees	382
sedgewick	475	shortest-path	343
handbook	440	dictionaries	316
ranger	371	sorting	295
xtango	282	suffix-trees	277
combinatorica	258	graph-data-structures	267
graphbase	251	nearest-neighbor	265
orourke	239	convex-hull	263
toms	230	priority-queues	258
goldberg	226	triangulations	239
syslo	213	generating-permutations	225
graphed	187	string-matching	222
moret	178	traveling-salesman	220
reingold	166	geometric-primitives	218
ruskey	151	network-flow	211
stony	146	intersection-detection	208
watson	144	voronoi-diagrams	206
simpack	140	minimum-spanning-tree	197
qhull	138	topological-sorting	191
lpsolve	138	matching	191

Statistics for Jan,1999

Implementation	Hits	Problems	Hits
LEDA	688	shortest-path	319
sedgewick	373	kd-trees	296
handbook	335	dictionaries	251
ranger	304	nearest-neighbor	242
xtango	232	convex-hull	227
orourke	229	graph-data-structures	220
graphbase	227	triangulations	214
goldberg	220	intersection-detection	210
toms	203	traveling-salesman	191
combinatorica	198	sorting	190
syslo	175	suffix-trees	188
moret	155	geometric-primitives	178
reingold	140	hamiltonian-cycle	172
graphed	139	voronoi-diagrams	168
stony	116	string-matching	166
simpack	113	priority-queues	162
watson	112	minkowski-sum	157
lpsolve	112	minimum-spanning-tree	151
dimacs	112	network-flow	141
ruskey	106	simplifying-polygons	138

Statistics for Dec,1998

Implementation	Hits	Problems	Hits
LEDA	848	shortest-path	367
sedgewick	454	minimum-spanning-tree	306
handbook	347	dictionaries	300
syslo	292	kd-trees	271
graphbase	267	graph-data-structures	251
goldberg	254	sorting	237
xtango	251	triangulations	228
ranger	223	traveling-salesman	215
toms	216	knapsack	210
orourke	214	vertex-coloring	204
combinatorica	195	network-flow	203
moret	145	string-matching	200
pari	138	matching	186
lpsolve	127	nearest-neighbor	183
graphed	127	convex-hull	183
fftpack	119	intersection-detection	179
stony	117	suffix-trees	171
eppstein	112	finite-state-minimization	170
watson	109	bin-packing	167
tsp	108	geometric-primitives	165

Statistics for Nov,1998

Implementation	Hits	Problems	Hits
LEDA	960	shortest-path	538
sedgewick	675	minimum-spanning-tree	355
handbook	484	knapsack	339
xtango	409	sorting	325
ranger	382	traveling-salesman	299
syslo	366	convex-hull	296
toms	349	kd-trees	294
goldberg	329	dictionaries	287
graphbase	286	string-matching	250
combinatorica	280	priority-queues	248
orourke	274	nearest-neighbor	244
moret	222	graph-data-structures	238
graphed	192	triangulations	228
fortune	159	network-flow	224
tsp	154	suffix-trees	216
lpsolve	144	voronoi-diagrams	197
qhull	140	intersection-detection	197
stony	138	geometric-primitives	190
watson	136	topological-sorting	189
reingold	133	matching	189

Statistics for Oct,1998

Implementation	Hits	Problems	Hits
LEDA	709	dictionaries	264
sedgewick	460	shortest-path	249
handbook	408	sorting	242
xtango	295	knapsack	227
ranger	278	nearest-neighbor	221
graphbase	252	hamiltonian-cycle	213
syslo	240	minimum-spanning-tree	201
toms	231	suffix-trees	196
orourke	228	convex-hull	196
combinatorica	201	voronoi-diagrams	191
goldberg	147	kd-trees	191
moret	146	graph-data-structures	191
fortune	118	traveling-salesman	188
stony	116	triangulations	187
graphed	112	intersection-detection	182
reingold	109	priority-queues	176
grail	106	point-location	174
tsp	105	geometric-primitives	170
lpsolve	105	string-matching	169
watson	103	vertex-coloring	167

Statistics for Sep,1998

Implementation	Hits	Problems	Hits
LEDA	909	sorting	279
sedgewick	572	kd-trees	275
handbook	427	convex-hull	270
ranger	335	voronoi-diagrams	256
toms	281	dictionaries	249
xtango	249	nearest-neighbor	244
lpsolve	237	graph-data-structures	236
syslo	236	traveling-salesman	234
graphbase	216	shortest-path	219
orourke	207	minimum-spanning-tree	216
fortune	198	triangulations	210
goldberg	176	linear-programming	181
combinatorica	176	intersection-detection	181
graphed	151	geometric-primitives	174
tsp	143	network-flow	166
moret	137	string-matching	165
simpack	131	matching	162
grail	129	priority-queues	161
dimacs	127	suffix-trees	151
qhull	119	finite-state-minimization	151

Statistics for Aug,1998

Implementation	Hits	Problems	Hits
LEDA	719	convex-hull	297
sedgewick	440	triangulations	291
handbook	378	voronoi-diagrams	276
ranger	296	dictionaries	256
toms	256	kd-trees	240
xtango	237	nearest-neighbor	237
orourke	232	traveling-salesman	233
syslo	230	minimum-spanning-tree	213
lpsolve	219	graph-data-structures	193
graphbase	218	intersection-detection	190
fortune	184	sorting	189
moret	162	shortest-path	181
qhull	161	linear-programming	174
combinatorica	160	geometric-primitives	173
graphed	154	string-matching	162
reingold	146	suffix-trees	161
goldberg	145	knapsack	156
simpack	137	range-search	150
tsp	134	matching	145
dimacs	134	priority-queues	142

Statistics for Jul,1998

Implementation	Hits	Problems	Hits
LEDA	816	shortest-path	308
sedgewick	496	nearest-neighbor	307
handbook	438	dictionaries	293
ranger	386	voronoi-diagrams	280
graphbase	261	kd-trees	273
xtango	247	minimum-spanning-tree	252
orourke	223	convex-hull	243
lpsolve	220	priority-queues	229
fortune	213	traveling-salesman	228
syslo	206	sorting	228
combinatorica	204	graph-data-structures	221
toms	192	triangulations	211
goldberg	184	suffix-trees	205
graphed	176	string-matching	199
moret	175	intersection-detection	176
stony	162	matching	169
simpack	148	network-flow	166
qhull	140	generating-permutations	163
watson	127	geometric-primitives	162
dimacs	123	linear-programming	160

Statistics for Jun,1998

Implementation	Hits	Problems	Hits
LEDA	508	voronoi-diagrams	232
sedgewick	333	convex-hull	189
handbook	257	triangulations	175
ranger	205	traveling-salesman	173
lpsolve	195	nearest-neighbor	172
xtango	192	dictionaries	167
fortune	187	kd-trees	163
combinatorica	172	geometric-primitives	156
graphbase	168	shortest-path	150
orourke	163	sorting	137
graphed	151	minimum-spanning-tree	136
toms	137	string-matching	134
syslo	131	linear-programming	128
eppstein	120	priority-queues	122
goldberg	114	matching	121
nauty	113	random-numbers	119
wilf	104	graph-data-structures	118
qhull	96	generating-permutations	113
moret	95	vertex-coloring	109
simpack	93	approximate-pattern-matching	108

Statistics for May,1998

Implementation	Hits	Problems	Hits
LEDA	819	traveling-salesman	349
sedgewick	452	voronoi-diagrams	286
handbook	430	minimum-spanning-tree	283
ranger	335	shortest-path	282
xtango	294	convex-hull	280
syslo	279	vertex-coloring	266
toms	264	nearest-neighbor	235
orourke	264	triangulations	229
lpsolve	260	kd-trees	205
combinatorica	256	linear-programming	196
graphbase	249	matching	190
fortune	243	dictionaries	189
goldberg	211	string-matching	186
tsp	188	graph-data-structures	183
qhull	163	sorting	181
trick	160	network-flow	181
moret	159	topological-sorting	174
graphed	154	priority-queues	163
pari	146	knapsack	158
nauty	136	geometric-primitives	157

Statistics for Apr,1998

Implementation	Hits	Problems	Hits
LEDA	1043	shortest-path	389
sedgewick	605	minimum-spanning-tree	318
ranger	423	convex-hull	299
handbook	393	kd-trees	290
xtango	321	traveling-salesman	281
orourke	305	nearest-neighbor	280
graphbase	275	voronoi-diagrams	275
combinatorica	270	triangulations	251
syslo	255	graph-data-structures	247
toms	248	sorting	234
moret	230	topological-sorting	222
goldberg	225	intersection-detection	217
lpsolve	195	geometric-primitives	214
graphed	178	dictionaries	189
fortune	169	priority-queues	183
tsp	167	string-matching	179
qhull	153	linear-programming	172
watson	127	matching	171
grail	127	knapsack	160
eppstein	127	suffix-trees	157

Statistics for Mar,1998

Implementation	Hits	Problems	Hits
LEDA	779	traveling-salesman	284
sedgewick	497	triangulations	267
handbook	435	minimum-spanning-tree	264
ranger	319	shortest-path	255
combinatorica	264	voronoi-diagrams	244
xtango	245	nearest-neighbor	234
graphbase	233	string-matching	213
syslo	208	kd-trees	208
orourke	206	graph-data-structures	207
toms	194	suffix-trees	201
goldberg	187	dictionaries	194
moret	186	convex-hull	191
fortune	166	sorting	186
eppstein	158	geometric-primitives	173
watson	150	priority-queues	166
lpsolve	149	matching	155
graphed	145	intersection-detection	143
pari	141	topological-sorting	140
simpack	131	vertex-coloring	139
tsp	124	approximate-pattern-matching	134

Statistics for Feb,1998

Implementation	Hits	Problems	Hits
LEDA	460	traveling-salesman	169
sedgewick	256	kd-trees	160
handbook	243	nearest-neighbor	157
ranger	191	voronoi-diagrams	137
toms	152	triangulations	137
orourke	149	minimum-spanning-tree	124
xtango	143	convex-hull	117
combinatorica	131	string-matching	111
eppstein	114	sorting	109
graphbase	109	shortest-path	107
syslo	107	graph-data-structures	106
moret	106	geometric-primitives	106
graphed	102	dictionaries	106
fortune	95	knapsack	100
dimacs	86	topological-sorting	95
tsp	77	suffix-trees	94
stony	73	priority-queues	89
lpsolve	73	intersection-detection	87
goldberg	72	matching	81
simpack	70	linear-programming	79