Skip to content

Commit 1a72543

Browse files
committed
[benchmark] Prims Legacy Factor
1 parent aecea33 commit 1a72543

File tree

2 files changed

+6
-4
lines changed

2 files changed

+6
-4
lines changed

benchmark/multi-source/PrimsSplit/Prims_main.swift

Lines changed: 3 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -15,11 +15,12 @@ import TestsUtils
1515
public let PrimsSplit = BenchmarkInfo(
1616
name: "PrimsSplit",
1717
runFunction: run_PrimsSplit,
18-
tags: [.validation, .algorithm])
18+
tags: [.validation, .algorithm],
19+
legacyFactor: 5)
1920

2021
@inline(never)
2122
public func run_PrimsSplit(_ N: Int) {
22-
for _ in 1...5*N {
23+
for _ in 1...N {
2324
let nodes : [Int] = [ 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12,
2425
13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28,
2526
29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44,

benchmark/single-source/Prims.swift

Lines changed: 3 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -25,7 +25,8 @@ import TestsUtils
2525
public let Prims = BenchmarkInfo(
2626
name: "Prims",
2727
runFunction: run_Prims,
28-
tags: [.validation, .algorithm])
28+
tags: [.validation, .algorithm],
29+
legacyFactor: 5)
2930

3031
class PriorityQueue {
3132
final var heap: Array<EdgeCost>
@@ -219,7 +220,7 @@ func Prims(_ graph : Array<GraphNode>, _ fun : (Int, Int) -> Double) -> Array<In
219220

220221
@inline(never)
221222
public func run_Prims(_ N: Int) {
222-
for _ in 1...5*N {
223+
for _ in 1...N {
223224
let nodes : [Int] = [ 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12,
224225
13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28,
225226
29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44,

0 commit comments

Comments
 (0)