Skip to content

Commit b44e9a0

Browse files
committed
Default to parallel=:threads everywhere
1 parent edad898 commit b44e9a0

File tree

7 files changed

+11
-11
lines changed

7 files changed

+11
-11
lines changed

src/Parallel/centrality/betweenness.jl

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -4,7 +4,7 @@ function betweenness_centrality(
44
distmx::AbstractMatrix=weights(g);
55
normalize=true,
66
endpoints=false,
7-
parallel=:distributed,
7+
parallel=:threads,
88
)
99
return if parallel == :distributed
1010
distr_betweenness_centrality(
@@ -23,7 +23,7 @@ function betweenness_centrality(
2323
distmx::AbstractMatrix=weights(g);
2424
normalize=true,
2525
endpoints=false,
26-
parallel=:distributed,
26+
parallel=:threads,
2727
rng::Union{Nothing,AbstractRNG}=nothing,
2828
seed::Union{Nothing,Integer}=nothing,
2929
)

src/Parallel/centrality/closeness.jl

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@ function closeness_centrality(
22
g::AbstractGraph,
33
distmx::AbstractMatrix=weights(g);
44
normalize=true,
5-
parallel=:distributed,
5+
parallel=:threads,
66
)
77
return if parallel == :distributed
88
distr_closeness_centrality(g, distmx; normalize=normalize)

src/Parallel/centrality/radiality.jl

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
1-
function radiality_centrality(g::AbstractGraph; parallel=:distributed)
1+
function radiality_centrality(g::AbstractGraph; parallel=:threads)
22
return if parallel == :distributed
33
distr_radiality_centrality(g)
44
else

src/Parallel/centrality/stress.jl

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
1-
function stress_centrality(g::AbstractGraph, vs=vertices(g); parallel=:distributed)
1+
function stress_centrality(g::AbstractGraph, vs=vertices(g); parallel=:threads)
22
return if parallel == :distributed
33
distr_stress_centrality(g, vs)
44
else
@@ -9,7 +9,7 @@ end
99
function stress_centrality(
1010
g::AbstractGraph,
1111
k::Integer;
12-
parallel=:distributed,
12+
parallel=:threads,
1313
rng::Union{Nothing,AbstractRNG}=nothing,
1414
seed::Union{Nothing,Integer}=nothing,
1515
)

src/Parallel/distance.jl

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -4,7 +4,7 @@ function eccentricity(
44
g::AbstractGraph,
55
vs=vertices(g),
66
distmx::AbstractMatrix{T}=weights(g);
7-
parallel=:distributed,
7+
parallel=:threads,
88
) where {T<:Number}
99
return if parallel === :threads
1010
threaded_eccentricity(g, vs, distmx)
@@ -36,7 +36,7 @@ function threaded_eccentricity(
3636
return eccs
3737
end
3838

39-
function eccentricity(g::AbstractGraph, distmx::AbstractMatrix; parallel=:distributed)
39+
function eccentricity(g::AbstractGraph, distmx::AbstractMatrix; parallel=:threads)
4040
return eccentricity(g, vertices(g), distmx; parallel)
4141
end
4242

src/Parallel/shortestpaths/dijkstra.jl

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -20,7 +20,7 @@ function dijkstra_shortest_paths(
2020
g::AbstractGraph{U},
2121
sources=vertices(g),
2222
distmx::AbstractMatrix{T}=weights(g);
23-
parallel=:distributed,
23+
parallel=:threads,
2424
) where {T<:Number} where {U}
2525
return if parallel === :threads
2626
threaded_dijkstra_shortest_paths(g, sources, distmx)

src/Parallel/traversals/greedy_color.jl

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
11
function random_greedy_color(
2-
g::AbstractGraph{T}, reps::Integer; parallel=:distributed
2+
g::AbstractGraph{T}, reps::Integer; parallel=:threads
33
) where {T<:Integer}
44
return if parallel === :threads
55
threaded_random_greedy_color(g, reps)
@@ -30,7 +30,7 @@ function distr_random_greedy_color(args...; kwargs...)
3030
end
3131

3232
function greedy_color(
33-
g::AbstractGraph{U}; sort_degree::Bool=false, reps::Integer=1, parallel=:distributed
33+
g::AbstractGraph{U}; sort_degree::Bool=false, reps::Integer=1, parallel=:threads
3434
) where {U<:Integer}
3535
return if sort_degree
3636
Graphs.degree_greedy_color(g)

0 commit comments

Comments
 (0)