In [1]:
include("../util.jl")
include("../io.jl")
include("../graph.jl")
include("../pr.jl")
include("../rw.jl")
Out[1]:
get_CC_MHRW_flying_ball (generic function with 3 methods)
In [2]:
@info("loading graph")
core = adjlist(UInt32, is_directed=true)
load_mgs3_graph(core, "../datasets/Arxiv_HEP-PH/Arxiv_HEP-PH_core.mgs")
#load_mgs4_graph(core, "../datasets/Arxiv_HEP-PH/Arxiv_HEP-PH_core.mgz")
EPSILON = 1e-8
BOOST = true
PROBA = false
┌ Info: loading graph
└ @ Main In[2]:1
Out[2]:
false
In [3]:
@info("getting rcore")
rcore = get_reverse_graph(core)
@info("transforming core from adj to inc list")
core2 = get_inclist_from_adjlist(core)
#serialize_to_jld(core2, "core", "Arxiv_HEP-PH_core_inclist")
┌ Info: getting rcore
└ @ Main In[3]:1
┌ Info: transforming core from adj to inc list
└ @ Main In[3]:4
Out[3]:
Directed Graph (12711 vertices, 139981 edges)
In [4]:
@info("computing Djikstra from vertex 1")
dists = ones(num_edges(core2))
s = convert(UInt32,1)
n = num_vertices(core)
@time r = dijkstra_shortest_paths(core2, dists, s)
┌ Info: computing Djikstra from vertex 1
└ @ Main In[4]:1
┌ Warning: `mutable_binary_minheap(::Type{T}) where T` is deprecated, use `MutableBinaryMinHeap{T}()` instead.
│ caller = create_dijkstra_states(::GenericIncidenceList{UInt32,Edge{UInt32},Array{UInt32,1},Array{Array{Edge{UInt32},1},1}}, ::Type{Float64}) at dijkstra_spath.jl:33
└ @ Graphs /home/jimmy/.julia/packages/Graphs/Oo0uj/src/dijkstra_spath.jl:33
1.694004 seconds (1.40 M allocations: 64.537 MiB, 1.20% gc time)
Out[4]:
DijkstraStates{UInt32,Float64,MutableBinaryHeap{Graphs.DijkstraHEntry{UInt32,Float64},DataStructures.LessThan},Int64}(UInt32[0x00000001, 0x00000001, 0x00000001, 0x00000001, 0x00000001, 0x00000001, 0x00000004, 0x00000004, 0x00000003, 0x00000005 … 0x00002f80, 0x000022c2, 0x00002eb5, 0x00000df6, 0x00001501, 0x00001194, 0x00001986, 0x00002ceb, 0x00002da2, 0x000028ad], [1, 1, 1, 1, 1, 1, 4, 4, 3, 5 … 12160, 8898, 11957, 3574, 5377, 4500, 6534, 11499, 11682, 10413], [0.0, 1.0, 1.0, 1.0, 1.0, 1.0, 2.0, 2.0, 2.0, 2.0 … 18.0, 19.0, 17.0, 9.0, 8.0, 15.0, 18.0, 19.0, 22.0, 8.0], [2, 2, 2, 2, 2, 2, 2, 2, 2, 2 … 2, 2, 2, 2, 2, 2, 2, 2, 2, 2], MutableBinaryHeap(), [0, 1, 2, 3, 4, 5, 14, 15, 12, 13 … 10855, 11267, 10286, 4423, 2875, 8515, 11033, 11426, 12138, 3542])
In [5]:
@info("getting P matrix for core and rcore")
P_core = get_sparse_P_matrix(core)
P_rcore = get_sparse_P_matrix(rcore)
┌ Info: getting P matrix for core and rcore
└ @ Main In[5]:1
Out[5]:
12711×12711 SparseMatrixCSC{Float64,UInt32} with 139981 stored entries:
[2 , 1] = 0.125
[3 , 1] = 0.0333333
[4 , 1] = 0.333333
[5 , 1] = 0.125
[6 , 1] = 0.111111
[11 , 2] = 0.0181818
[12 , 2] = 0.0117647
[13 , 2] = 0.0384615
[9 , 3] = 0.00909091
[2 , 4] = 0.125
[7 , 4] = 0.0140845
[8 , 4] = 1.0
⋮
[5538 , 12709] = 0.0163934
[6579 , 12709] = 0.0322581
[7836 , 12709] = 0.0769231
[7837 , 12709] = 0.0344828
[7838 , 12709] = 0.047619
[7840 , 12709] = 0.0526316
[7849 , 12709] = 0.0588235
[7859 , 12709] = 0.142857
[8326 , 12709] = 0.25
[7367 , 12710] = 0.0833333
[7788 , 12710] = 0.333333
[8642 , 12711] = 0.125
In [6]:
@info("computing Pagerank of core and rcore")
@time pr_core = PR(P_core, epsilon=EPSILON)
@time pr_rcore = PR(P_rcore, epsilon=EPSILON)
┌ Info: computing Pagerank of core and rcore
└ @ Main In[6]:1
0.732237 seconds (1.52 M allocations: 265.033 MiB, 5.20% gc time)
0.160240 seconds (1.70 k allocations: 221.591 MiB, 4.21% gc time)
Out[6]:
12711-element Array{Float64,1}:
2.350561384785796e-5
1.3190499858884635e-5
1.2688331396031786e-5
2.4582610996974003e-5
1.3945502994106454e-5
1.5850961479798863e-5
1.3228454989530733e-5
1.3202293064630945e-5
0.0001148566854541946
1.4701629075185293e-5
1.556032991231611e-5
1.3615841249955668e-5
3.098775329777239e-5
⋮
2.7115045406092217e-5
1.2899968765827815e-5
5.616846554919839e-5
1.2350273743958044e-5
1.896742629843268e-5
2.385475553524078e-5
7.770824579878605e-5
1.39703875651207e-5
1.441524834713952e-5
2.2738111886290673e-5
1.7368549766374322e-5
1.3206918517539172e-5
In [7]:
@info("computing personalized Pagerank for node source s")
ppr_s = zeros(Float64,n)
ppr_s[s] = 1.
@time pr_s = PR(P_core, ppr=ppr_s, init_pr=pr_core, epsilon=EPSILON)
#ppr_t = zeros(Float64,n)
#ppr_t[t] = 1.
#@time pr_t = PR(P_rcore, ppr=ppr_t, init_pr=pr_rcore, epsilon=EPSILON)
┌ Info: computing personalized Pageranks for node source s
└ @ Main In[7]:1
0.175537 seconds (16.32 k allocations: 218.518 MiB, 7.58% gc time)
Out[7]:
12711-element Array{Float64,1}:
0.15000003731612713
0.038866759406976294
0.050230378861523144
0.02550000634671131
0.029835053245943103
0.02550004550935444
0.017128007446500698
0.007225001798234415
0.04550645677011783
0.013936024706478353
0.018528038368541798
0.011869258165109794
0.011013387479540728
⋮
9.462670836272003e-23
2.681060615354438e-23
2.0684318175446665e-22
6.608202201309307e-24
7.750568049075789e-21
5.38873067805767e-10
4.420929713703215e-8
6.450807328120184e-19
3.603240303993202e-24
2.1903119837504916e-23
2.3468167356646387e-24
8.292256397101807e-8
In [8]:
@info("applying boost if required")
pr_boost = Float64[]
if BOOST
pr_boost = pr_core .* pr_rcore
end
┌ Info: applying boost if required
└ @ Main In[8]:1
Out[8]:
12711-element Array{Float64,1}:
2.8630839201720067e-10
7.356287269106203e-10
1.9324559439929897e-9
4.624789671652907e-10
3.753577070034752e-10
4.788802258661197e-10
3.5886090291884844e-8
2.261714548809294e-10
2.3547523702840967e-7
6.499734047929022e-10
2.2260388847691e-8
1.1063939824884205e-8
4.438398053661328e-9
⋮
6.539943222245125e-10
2.403855964736193e-10
6.842349426113759e-10
1.603872123254634e-10
2.708072201384572e-10
3.3039970896921846e-10
9.59108664672014e-10
2.0056446795939507e-10
1.7457466917720457e-10
3.020386234186998e-10
2.3056013341965762e-10
2.110879393021876e-10
In [9]:
function get_sp_greedy(s::T, t::T, g::GenericAdjacencyList{T,Array{T,1},Array{Array{T,1},1}}, df::Array{Float64,1}, max_length::Int64) where {T<:Unsigned}
@info("searching shortest path (greedy approach) between vertices $s and $t")
# current vertex
cv = s
# current path
sp = T[]
while length(sp) < max_length
push!(sp,cv)
nei = out_neighbors(cv,g)
nnei = setdiff(nei,sp)
if length(nnei) == 0
@info("--- exploration reached a dead end")
@info("--- explored path: ", sp)
break
end
cv = nnei[findmax(df[nnei])[2]]
# a path was found
if cv == t
push!(sp,t)
@info("path found: ", sp)
break
end
end
return sp
end
function get_sp_proba(s::T, t::T, g::GenericAdjacencyList{T,Array{T,1},Array{Array{T,1},1}}, df::Array{Float64,1}, max_length::Int64, max_iter::Int64) where {T<:Unsigned}
@info("searching shortest path (probabilistic approach) between vertices $s and $t")
# array of paths
sps = Array{Array{T,1},1}()
# current path
sp = T[]
# search in a probabilistic way shortest paths between s and t
cv = s
c = 0
# shortest length found so far
min_length = Inf
while c < max_iter
sp = T[]
cv = s
# path length
pl = 1
while pl < max_length && pl < (min_length-1)
push!(sp,cv)
nei = out_neighbors(cv, g)
nnei = setdiff(nei,sp)
if length(nnei) == 0
@debug("--- exploration reached a dead end")
@debug("--- explored path: ", sp)
break
end
pos = get_flying_index(df[nnei] / sum(df[nnei]))
cv = nnei[pos]
# we found a path
if cv == t
push!(sp,t)
pl += 1
if !(sp in sps)
@info("path found between $s and $t (length $pl): ", sp)
push!(sps,sp)
# update min_length if necessary
if pl < min_length
min_length = pl
end
end
break
end
pl += 1
end
c += 1
end
return sps
end
Out[9]:
get_sp_proba (generic function with 1 method)
In [11]:
# max paths length
#ml = floor(Int,log(length(vertices(core))))
ml = 20
sp = UInt32[]
# total of node pairs analyzed
tc = 0
# Djikstra path == DF path
sc = 0
# Djikstra path length == DF path length
sc2 = 0
for t in UInt32(2):UInt32(100)
# get paths using Djikstra
paths = enumerate_paths(vertices(core2), r.parent_indices, Int64[t])
@info("computing personalized Pagerank for target node source t: ", t)
ppr_t = zeros(Float64,n)
ppr_t[t] = 1.
@time pr_t = PR(P_rcore, ppr=ppr_t, init_pr=pr_rcore, epsilon=EPSILON)
@info("computing DF")
df = pr_s .* pr_t
if BOOST
df = df ./ pr_boost
end
if PROBA
sps = get_sp_proba(s, t, core, df, ml, convert(Int64,1e3))
else
sp = get_sp_greedy(s, t, core, df, ml)
end
@info("----- SP (Djikstra): ", convert(Array{Int64,1}, paths[1]))
if PROBA
if length(sps) > 0
mi = findmin(Int64[length(a) for a in sps])[2]
sp = sps[mi]
else
sp = UInt32[]
end
end
@info("----- SP (DF): ", convert(Array{Int64,1}, sp))
if paths[1] == sp
sc += 1
end
if length(paths[1]) == length(sp)
sc2 += 1
end
tc += 1
end
@info("% same SP: ", sc/tc)
@info("% same length: ", sc2/tc)
┌ Info: computing personalized Pagerank for target node source t:
│ t = 2
└ @ Main In[11]:18
0.177189 seconds (1.91 k allocations: 250.916 MiB, 8.87% gc time)
┌ Info: computing DF
└ @ Main In[11]:23
┌ Info: searching shortest path (greedy approach) between vertices 1 and 2
└ @ Main In[9]:2
┌ Info: path found:
│ sp = UInt32[0x00000001, 0x00000002]
└ @ Main In[9]:21
┌ Info: ----- SP (Djikstra):
│ convert(Array{Int64, 1}, paths[1]) = [1, 2]
└ @ Main In[11]:36
┌ Info: ----- SP (DF):
│ convert(Array{Int64, 1}, sp) = [1, 2]
└ @ Main In[11]:46
┌ Info: computing personalized Pagerank for target node source t:
│ t = 3
└ @ Main In[11]:18
0.173661 seconds (1.91 k allocations: 250.916 MiB, 4.65% gc time)
┌ Info: computing DF
└ @ Main In[11]:23
┌ Info: searching shortest path (greedy approach) between vertices 1 and 3
└ @ Main In[9]:2
┌ Info: path found:
│ sp = UInt32[0x00000001, 0x00000003]
└ @ Main In[9]:21
┌ Info: ----- SP (Djikstra):
│ convert(Array{Int64, 1}, paths[1]) = [1, 3]
└ @ Main In[11]:36
┌ Info: ----- SP (DF):
│ convert(Array{Int64, 1}, sp) = [1, 3]
└ @ Main In[11]:46
┌ Info: computing personalized Pagerank for target node source t:
│ t = 4
└ @ Main In[11]:18
0.176997 seconds (1.88 k allocations: 247.226 MiB, 4.56% gc time)
┌ Info: computing DF
└ @ Main In[11]:23
┌ Info: searching shortest path (greedy approach) between vertices 1 and 4
└ @ Main In[9]:2
┌ Info: path found:
│ sp = UInt32[0x00000001, 0x00000004]
└ @ Main In[9]:21
┌ Info: ----- SP (Djikstra):
│ convert(Array{Int64, 1}, paths[1]) = [1, 4]
└ @ Main In[11]:36
┌ Info: ----- SP (DF):
│ convert(Array{Int64, 1}, sp) = [1, 4]
└ @ Main In[11]:46
┌ Info: computing personalized Pagerank for target node source t:
│ t = 5
└ @ Main In[11]:18
0.185411 seconds (1.91 k allocations: 250.916 MiB, 4.83% gc time)
┌ Info: computing DF
└ @ Main In[11]:23
┌ Info: searching shortest path (greedy approach) between vertices 1 and 5
└ @ Main In[9]:2
┌ Info: path found:
│ sp = UInt32[0x00000001, 0x00000005]
└ @ Main In[9]:21
┌ Info: ----- SP (Djikstra):
│ convert(Array{Int64, 1}, paths[1]) = [1, 5]
└ @ Main In[11]:36
┌ Info: ----- SP (DF):
│ convert(Array{Int64, 1}, sp) = [1, 5]
└ @ Main In[11]:46
┌ Info: computing personalized Pagerank for target node source t:
│ t = 6
└ @ Main In[11]:18
0.184264 seconds (1.88 k allocations: 247.226 MiB, 4.39% gc time)
┌ Info: computing DF
└ @ Main In[11]:23
┌ Info: searching shortest path (greedy approach) between vertices 1 and 6
└ @ Main In[9]:2
┌ Info: path found:
│ sp = UInt32[0x00000001, 0x00000006]
└ @ Main In[9]:21
┌ Info: ----- SP (Djikstra):
│ convert(Array{Int64, 1}, paths[1]) = [1, 6]
└ @ Main In[11]:36
┌ Info: ----- SP (DF):
│ convert(Array{Int64, 1}, sp) = [1, 6]
└ @ Main In[11]:46
┌ Info: computing personalized Pagerank for target node source t:
│ t = 7
└ @ Main In[11]:18
0.180604 seconds (1.91 k allocations: 250.916 MiB, 4.56% gc time)
┌ Info: computing DF
└ @ Main In[11]:23
┌ Info: searching shortest path (greedy approach) between vertices 1 and 7
└ @ Main In[9]:2
┌ Info: path found:
│ sp = UInt32[0x00000001, 0x00000004, 0x00000007]
└ @ Main In[9]:21
┌ Info: ----- SP (Djikstra):
│ convert(Array{Int64, 1}, paths[1]) = [1, 4, 7]
└ @ Main In[11]:36
┌ Info: ----- SP (DF):
│ convert(Array{Int64, 1}, sp) = [1, 4, 7]
└ @ Main In[11]:46
┌ Info: computing personalized Pagerank for target node source t:
│ t = 8
└ @ Main In[11]:18
0.196205 seconds (1.91 k allocations: 250.916 MiB, 4.47% gc time)
┌ Info: computing DF
└ @ Main In[11]:23
┌ Info: searching shortest path (greedy approach) between vertices 1 and 8
└ @ Main In[9]:2
┌ Info: path found:
│ sp = UInt32[0x00000001, 0x00000004, 0x00000008]
└ @ Main In[9]:21
┌ Info: ----- SP (Djikstra):
│ convert(Array{Int64, 1}, paths[1]) = [1, 4, 8]
└ @ Main In[11]:36
┌ Info: ----- SP (DF):
│ convert(Array{Int64, 1}, sp) = [1, 4, 8]
└ @ Main In[11]:46
┌ Info: computing personalized Pagerank for target node source t:
│ t = 9
└ @ Main In[11]:18
0.171756 seconds (1.85 k allocations: 243.536 MiB, 4.59% gc time)
┌ Info: computing DF
└ @ Main In[11]:23
┌ Info: searching shortest path (greedy approach) between vertices 1 and 9
└ @ Main In[9]:2
┌ Info: path found:
│ sp = UInt32[0x00000001, 0x00000003, 0x00000009]
└ @ Main In[9]:21
┌ Info: ----- SP (Djikstra):
│ convert(Array{Int64, 1}, paths[1]) = [1, 3, 9]
└ @ Main In[11]:36
┌ Info: ----- SP (DF):
│ convert(Array{Int64, 1}, sp) = [1, 3, 9]
└ @ Main In[11]:46
┌ Info: computing personalized Pagerank for target node source t:
│ t = 10
└ @ Main In[11]:18
0.173651 seconds (1.88 k allocations: 247.226 MiB, 5.11% gc time)
┌ Info: computing DF
└ @ Main In[11]:23
┌ Info: searching shortest path (greedy approach) between vertices 1 and 10
└ @ Main In[9]:2
┌ Info: path found:
│ sp = UInt32[0x00000001, 0x00000005, 0x0000000a]
└ @ Main In[9]:21
┌ Info: ----- SP (Djikstra):
│ convert(Array{Int64, 1}, paths[1]) = [1, 5, 10]
└ @ Main In[11]:36
┌ Info: ----- SP (DF):
│ convert(Array{Int64, 1}, sp) = [1, 5, 10]
└ @ Main In[11]:46
┌ Info: computing personalized Pagerank for target node source t:
│ t = 11
└ @ Main In[11]:18
0.180549 seconds (1.96 k allocations: 258.296 MiB, 4.75% gc time)
┌ Info: computing DF
└ @ Main In[11]:23
┌ Info: searching shortest path (greedy approach) between vertices 1 and 11
└ @ Main In[9]:2
┌ Info: path found:
│ sp = UInt32[0x00000001, 0x00000002, 0x0000000b]
└ @ Main In[9]:21
┌ Info: ----- SP (Djikstra):
│ convert(Array{Int64, 1}, paths[1]) = [1, 2, 11]
└ @ Main In[11]:36
┌ Info: ----- SP (DF):
│ convert(Array{Int64, 1}, sp) = [1, 2, 11]
└ @ Main In[11]:46
┌ Info: computing personalized Pagerank for target node source t:
│ t = 12
└ @ Main In[11]:18
0.176813 seconds (1.91 k allocations: 250.916 MiB, 5.20% gc time)
┌ Info: computing DF
└ @ Main In[11]:23
┌ Info: searching shortest path (greedy approach) between vertices 1 and 12
└ @ Main In[9]:2
┌ Info: path found:
│ sp = UInt32[0x00000001, 0x00000002, 0x0000000c]
└ @ Main In[9]:21
┌ Info: ----- SP (Djikstra):
│ convert(Array{Int64, 1}, paths[1]) = [1, 2, 12]
└ @ Main In[11]:36
┌ Info: ----- SP (DF):
│ convert(Array{Int64, 1}, sp) = [1, 2, 12]
└ @ Main In[11]:46
┌ Info: computing personalized Pagerank for target node source t:
│ t = 13
└ @ Main In[11]:18
0.177723 seconds (1.93 k allocations: 254.606 MiB, 4.28% gc time)
┌ Info: computing DF
└ @ Main In[11]:23
┌ Info: searching shortest path (greedy approach) between vertices 1 and 13
└ @ Main In[9]:2
┌ Info: path found:
│ sp = UInt32[0x00000001, 0x00000002, 0x0000000d]
└ @ Main In[9]:21
┌ Info: ----- SP (Djikstra):
│ convert(Array{Int64, 1}, paths[1]) = [1, 2, 13]
└ @ Main In[11]:36
┌ Info: ----- SP (DF):
│ convert(Array{Int64, 1}, sp) = [1, 2, 13]
└ @ Main In[11]:46
┌ Info: computing personalized Pagerank for target node source t:
│ t = 14
└ @ Main In[11]:18
0.166255 seconds (1.79 k allocations: 236.156 MiB, 4.92% gc time)
┌ Info: computing DF
└ @ Main In[11]:23
┌ Info: searching shortest path (greedy approach) between vertices 1 and 14
└ @ Main In[9]:2
┌ Info: path found:
│ sp = UInt32[0x00000001, 0x00000006, 0x0000000e]
└ @ Main In[9]:21
┌ Info: ----- SP (Djikstra):
│ convert(Array{Int64, 1}, paths[1]) = [1, 6, 14]
└ @ Main In[11]:36
┌ Info: ----- SP (DF):
│ convert(Array{Int64, 1}, sp) = [1, 6, 14]
└ @ Main In[11]:46
┌ Info: computing personalized Pagerank for target node source t:
│ t = 15
└ @ Main In[11]:18
0.183648 seconds (1.85 k allocations: 243.536 MiB, 4.29% gc time)
┌ Info: computing DF
└ @ Main In[11]:23
┌ Info: searching shortest path (greedy approach) between vertices 1 and 15
└ @ Main In[9]:2
┌ Info: path found:
│ sp = UInt32[0x00000001, 0x00000006, 0x0000000f]
└ @ Main In[9]:21
┌ Info: ----- SP (Djikstra):
│ convert(Array{Int64, 1}, paths[1]) = [1, 6, 15]
└ @ Main In[11]:36
┌ Info: ----- SP (DF):
│ convert(Array{Int64, 1}, sp) = [1, 6, 15]
└ @ Main In[11]:46
┌ Info: computing personalized Pagerank for target node source t:
│ t = 16
└ @ Main In[11]:18
0.175419 seconds (1.85 k allocations: 243.536 MiB, 4.76% gc time)
┌ Info: computing DF
└ @ Main In[11]:23
┌ Info: searching shortest path (greedy approach) between vertices 1 and 16
└ @ Main In[9]:2
┌ Info: path found:
│ sp = UInt32[0x00000001, 0x00000006, 0x00000010]
└ @ Main In[9]:21
┌ Info: ----- SP (Djikstra):
│ convert(Array{Int64, 1}, paths[1]) = [1, 6, 16]
└ @ Main In[11]:36
┌ Info: ----- SP (DF):
│ convert(Array{Int64, 1}, sp) = [1, 6, 16]
└ @ Main In[11]:46
┌ Info: computing personalized Pagerank for target node source t:
│ t = 17
└ @ Main In[11]:18
0.188028 seconds (1.96 k allocations: 258.296 MiB, 4.78% gc time)
┌ Info: computing DF
└ @ Main In[11]:23
┌ Info: searching shortest path (greedy approach) between vertices 1 and 17
└ @ Main In[9]:2
┌ Info: --- exploration reached a dead end
└ @ Main In[9]:12
┌ Info: --- explored path:
│ sp = UInt32[0x00000001, 0x00000003, 0x00000009, 0x0000166f, 0x000024a9, 0x000014a1, 0x000014f9, 0x00002ccd, 0x000000ab, 0x00000679, 0x000012b9, 0x00000c13, 0x00000c0d, 0x000007a4, 0x00000082, 0x00000d4a, 0x0000064f, 0x000029d5, 0x00003180, 0x000021e8]
└ @ Main In[9]:13
┌ Info: ----- SP (Djikstra):
│ convert(Array{Int64, 1}, paths[1]) = [1, 3, 9, 5743, 9385, 8405, 1499, 171, 1657, 4793, 3091, 11219, 9040, 190, 46, 17]
└ @ Main In[11]:36
┌ Info: ----- SP (DF):
│ convert(Array{Int64, 1}, sp) = [1, 3, 9, 5743, 9385, 5281, 5369, 11469, 171, 1657, 4793, 3091, 3085, 1956, 130, 3402, 1615, 10709, 12672, 8680]
└ @ Main In[11]:46
┌ Info: computing personalized Pagerank for target node source t:
│ t = 18
└ @ Main In[11]:18
0.189825 seconds (1.99 k allocations: 261.986 MiB, 4.65% gc time)
┌ Info: computing DF
└ @ Main In[11]:23
┌ Info: searching shortest path (greedy approach) between vertices 1 and 18
└ @ Main In[9]:2
┌ Info: --- exploration reached a dead end
└ @ Main In[9]:12
┌ Info: --- explored path:
│ sp = UInt32[0x00000001, 0x00000003, 0x00000009, 0x0000166f, 0x000024a9, 0x000014a1, 0x000014f9, 0x00002ccd, 0x000000ab, 0x00000679, 0x000012b9, 0x00000c13, 0x00000c0d, 0x000007a4, 0x00000082, 0x00000d4a, 0x0000064f, 0x000029d5, 0x00003180, 0x000021e8]
└ @ Main In[9]:13
┌ Info: ----- SP (Djikstra):
│ convert(Array{Int64, 1}, paths[1]) = [1, 3, 9, 5743, 9385, 8405, 1499, 171, 1657, 4793, 3091, 11219, 12661, 1514, 18]
└ @ Main In[11]:36
┌ Info: ----- SP (DF):
│ convert(Array{Int64, 1}, sp) = [1, 3, 9, 5743, 9385, 5281, 5369, 11469, 171, 1657, 4793, 3091, 3085, 1956, 130, 3402, 1615, 10709, 12672, 8680]
└ @ Main In[11]:46
┌ Info: computing personalized Pagerank for target node source t:
│ t = 19
└ @ Main In[11]:18
0.187076 seconds (2.05 k allocations: 269.366 MiB, 4.56% gc time)
┌ Info: computing DF
└ @ Main In[11]:23
┌ Info: searching shortest path (greedy approach) between vertices 1 and 19
└ @ Main In[9]:2
┌ Info: --- exploration reached a dead end
└ @ Main In[9]:12
┌ Info: --- explored path:
│ sp = UInt32[0x00000001, 0x00000003, 0x00000009, 0x0000166f, 0x000024a9, 0x000014a1, 0x000014f9, 0x00002ccd, 0x000000ab, 0x00000679, 0x000012b9, 0x00000c13, 0x00000c0d, 0x000007a4, 0x00000082, 0x00000d4a, 0x0000064f, 0x000029d5, 0x00003180, 0x000021e8]
└ @ Main In[9]:13
┌ Info: ----- SP (Djikstra):
│ convert(Array{Int64, 1}, paths[1]) = [1, 3, 9, 5743, 9385, 8405, 1499, 171, 1657, 4793, 3091, 11219, 12687, 3376, 3760, 1337, 19]
└ @ Main In[11]:36
┌ Info: ----- SP (DF):
│ convert(Array{Int64, 1}, sp) = [1, 3, 9, 5743, 9385, 5281, 5369, 11469, 171, 1657, 4793, 3091, 3085, 1956, 130, 3402, 1615, 10709, 12672, 8680]
└ @ Main In[11]:46
┌ Info: computing personalized Pagerank for target node source t:
│ t = 20
└ @ Main In[11]:18
0.193164 seconds (2.07 k allocations: 273.056 MiB, 4.86% gc time)
┌ Info: computing DF
└ @ Main In[11]:23
┌ Info: searching shortest path (greedy approach) between vertices 1 and 20
└ @ Main In[9]:2
┌ Info: --- exploration reached a dead end
└ @ Main In[9]:12
┌ Info: --- explored path:
│ sp = UInt32[0x00000001, 0x00000003, 0x00000009, 0x0000166f, 0x000024a9, 0x000014a1, 0x000014f9, 0x00002ccd, 0x000000ab, 0x00000679, 0x000012b9, 0x00000c13, 0x00000c0d, 0x000007a4, 0x00000082, 0x00000d4a, 0x0000064f, 0x000029d5, 0x00003180, 0x000021e8]
└ @ Main In[9]:13
┌ Info: ----- SP (Djikstra):
│ convert(Array{Int64, 1}, paths[1]) = [1, 3, 9, 5743, 9385, 8405, 1499, 171, 1657, 4793, 3091, 11219, 12687, 10152, 10158, 10163, 195, 20]
└ @ Main In[11]:36
┌ Info: ----- SP (DF):
│ convert(Array{Int64, 1}, sp) = [1, 3, 9, 5743, 9385, 5281, 5369, 11469, 171, 1657, 4793, 3091, 3085, 1956, 130, 3402, 1615, 10709, 12672, 8680]
└ @ Main In[11]:46
┌ Info: computing personalized Pagerank for target node source t:
│ t = 21
└ @ Main In[11]:18
0.199944 seconds (1.96 k allocations: 258.296 MiB, 4.14% gc time)
┌ Info: computing DF
└ @ Main In[11]:23
┌ Info: searching shortest path (greedy approach) between vertices 1 and 21
└ @ Main In[9]:2
┌ Info: path found:
│ sp = UInt32[0x00000001, 0x00000003, 0x00000009, 0x0000166f, 0x000024a9, 0x000020d5, 0x00000015]
└ @ Main In[9]:21
┌ Info: ----- SP (Djikstra):
│ convert(Array{Int64, 1}, paths[1]) = [1, 4, 7, 215, 1359, 21]
└ @ Main In[11]:36
┌ Info: ----- SP (DF):
│ convert(Array{Int64, 1}, sp) = [1, 3, 9, 5743, 9385, 8405, 21]
└ @ Main In[11]:46
┌ Info: computing personalized Pagerank for target node source t:
│ t = 22
└ @ Main In[11]:18
0.306822 seconds (1.93 k allocations: 254.606 MiB, 4.68% gc time)
┌ Info: computing DF
└ @ Main In[11]:23
┌ Info: searching shortest path (greedy approach) between vertices 1 and 22
└ @ Main In[9]:2
┌ Info: path found:
│ sp = UInt32[0x00000001, 0x00000004, 0x00000007, 0x000000d7, 0x0000054f, 0x00000016]
└ @ Main In[9]:21
┌ Info: ----- SP (Djikstra):
│ convert(Array{Int64, 1}, paths[1]) = [1, 4, 7, 215, 1359, 22]
└ @ Main In[11]:36
┌ Info: ----- SP (DF):
│ convert(Array{Int64, 1}, sp) = [1, 4, 7, 215, 1359, 22]
└ @ Main In[11]:46
┌ Info: computing personalized Pagerank for target node source t:
│ t = 23
└ @ Main In[11]:18
0.238850 seconds (1.88 k allocations: 247.226 MiB, 4.72% gc time)
┌ Info: computing DF
└ @ Main In[11]:23
┌ Info: searching shortest path (greedy approach) between vertices 1 and 23
└ @ Main In[9]:2
┌ Info: path found:
│ sp = UInt32[0x00000001, 0x00000004, 0x00000007, 0x000000d7, 0x0000054f, 0x00000017]
└ @ Main In[9]:21
┌ Info: ----- SP (Djikstra):
│ convert(Array{Int64, 1}, paths[1]) = [1, 4, 7, 215, 1359, 23]
└ @ Main In[11]:36
┌ Info: ----- SP (DF):
│ convert(Array{Int64, 1}, sp) = [1, 4, 7, 215, 1359, 23]
└ @ Main In[11]:46
┌ Info: computing personalized Pagerank for target node source t:
│ t = 24
└ @ Main In[11]:18
0.176162 seconds (1.96 k allocations: 258.296 MiB, 4.97% gc time)
┌ Info: computing DF
└ @ Main In[11]:23
┌ Info: searching shortest path (greedy approach) between vertices 1 and 24
└ @ Main In[9]:2
┌ Info: path found:
│ sp = UInt32[0x00000001, 0x00000003, 0x00000009, 0x0000166f, 0x000024a9, 0x000014a1, 0x000014f9, 0x000012cd, 0x00000018]
└ @ Main In[9]:21
┌ Info: ----- SP (Djikstra):
│ convert(Array{Int64, 1}, paths[1]) = [1, 3, 9, 5743, 9385, 5281, 5369, 4813, 24]
└ @ Main In[11]:36
┌ Info: ----- SP (DF):
│ convert(Array{Int64, 1}, sp) = [1, 3, 9, 5743, 9385, 5281, 5369, 4813, 24]
└ @ Main In[11]:46
┌ Info: computing personalized Pagerank for target node source t:
│ t = 25
└ @ Main In[11]:18
0.176445 seconds (1.96 k allocations: 258.296 MiB, 4.59% gc time)
┌ Info: computing DF
└ @ Main In[11]:23
┌ Info: searching shortest path (greedy approach) between vertices 1 and 25
└ @ Main In[9]:2
┌ Info: path found:
│ sp = UInt32[0x00000001, 0x00000003, 0x00000009, 0x0000166f, 0x000024a9, 0x000014a1, 0x000014f9, 0x000012cd, 0x00000019]
└ @ Main In[9]:21
┌ Info: ----- SP (Djikstra):
│ convert(Array{Int64, 1}, paths[1]) = [1, 3, 9, 5743, 9385, 5281, 5369, 4813, 25]
└ @ Main In[11]:36
┌ Info: ----- SP (DF):
│ convert(Array{Int64, 1}, sp) = [1, 3, 9, 5743, 9385, 5281, 5369, 4813, 25]
└ @ Main In[11]:46
┌ Info: computing personalized Pagerank for target node source t:
│ t = 26
└ @ Main In[11]:18
0.183015 seconds (1.96 k allocations: 258.296 MiB, 4.79% gc time)
┌ Info: computing DF
└ @ Main In[11]:23
┌ Info: searching shortest path (greedy approach) between vertices 1 and 26
└ @ Main In[9]:2
┌ Info: --- exploration reached a dead end
└ @ Main In[9]:12
┌ Info: --- explored path:
│ sp = UInt32[0x00000001, 0x00000003, 0x00000009, 0x0000166f, 0x000024a9, 0x000014a1, 0x000014f9, 0x00002ccd, 0x000000ab, 0x00000679, 0x000012b9, 0x00000c13, 0x00000c0d, 0x000007a4, 0x00000082, 0x00000d4a, 0x0000064f, 0x000029d5, 0x00003180, 0x000021e8]
└ @ Main In[9]:13
┌ Info: ----- SP (Djikstra):
│ convert(Array{Int64, 1}, paths[1]) = [1, 3, 9, 5743, 9385, 8405, 1499, 171, 1657, 4793, 3091, 11219, 12661, 1514, 18, 26]
└ @ Main In[11]:36
┌ Info: ----- SP (DF):
│ convert(Array{Int64, 1}, sp) = [1, 3, 9, 5743, 9385, 5281, 5369, 11469, 171, 1657, 4793, 3091, 3085, 1956, 130, 3402, 1615, 10709, 12672, 8680]
└ @ Main In[11]:46
┌ Info: computing personalized Pagerank for target node source t:
│ t = 27
└ @ Main In[11]:18
0.239839 seconds (1.93 k allocations: 254.606 MiB, 4.61% gc time)
┌ Info: computing DF
└ @ Main In[11]:23
┌ Info: searching shortest path (greedy approach) between vertices 1 and 27
└ @ Main In[9]:2
┌ Info: --- exploration reached a dead end
└ @ Main In[9]:12
┌ Info: --- explored path:
│ sp = UInt32[0x00000001, 0x00000003, 0x00000009, 0x0000166f, 0x000024a9, 0x000014a1, 0x000014f9, 0x00002ccd, 0x000000ab, 0x00000679, 0x000012b9, 0x00000c13, 0x00000c0d, 0x000007a4, 0x00000082, 0x00000d4a, 0x0000064f, 0x000029d5, 0x00003180, 0x000021e8]
└ @ Main In[9]:13
┌ Info: ----- SP (Djikstra):
│ convert(Array{Int64, 1}, paths[1]) = [1, 3, 9, 5743, 9385, 9398, 6109, 3809, 2942, 4357, 9094, 4393, 4340, 9326, 180, 27]
└ @ Main In[11]:36
┌ Info: ----- SP (DF):
│ convert(Array{Int64, 1}, sp) = [1, 3, 9, 5743, 9385, 5281, 5369, 11469, 171, 1657, 4793, 3091, 3085, 1956, 130, 3402, 1615, 10709, 12672, 8680]
└ @ Main In[11]:46
┌ Info: computing personalized Pagerank for target node source t:
│ t = 28
└ @ Main In[11]:18
0.254326 seconds (1.96 k allocations: 258.296 MiB, 3.89% gc time)
┌ Info: computing DF
└ @ Main In[11]:23
┌ Info: searching shortest path (greedy approach) between vertices 1 and 28
└ @ Main In[9]:2
┌ Info: --- exploration reached a dead end
└ @ Main In[9]:12
┌ Info: --- explored path:
│ sp = UInt32[0x00000001, 0x00000003, 0x00000009, 0x0000166f, 0x000024a9, 0x000014a1, 0x000014f9, 0x00002ccd, 0x000000ab, 0x00000679, 0x000012b9, 0x00000c13, 0x00000c0d, 0x000007a4, 0x00000082, 0x00000d4a, 0x0000064f, 0x000029d5, 0x00003180, 0x000021e8]
└ @ Main In[9]:13
┌ Info: ----- SP (Djikstra):
│ convert(Array{Int64, 1}, paths[1]) = [1, 3, 9, 5743, 9385, 8405, 1499, 171, 1657, 4793, 3091, 11219, 9040, 190, 48, 28]
└ @ Main In[11]:36
┌ Info: ----- SP (DF):
│ convert(Array{Int64, 1}, sp) = [1, 3, 9, 5743, 9385, 5281, 5369, 11469, 171, 1657, 4793, 3091, 3085, 1956, 130, 3402, 1615, 10709, 12672, 8680]
└ @ Main In[11]:46
┌ Info: computing personalized Pagerank for target node source t:
│ t = 29
└ @ Main In[11]:18
0.186474 seconds (1.93 k allocations: 254.606 MiB, 5.29% gc time)
┌ Info: computing DF
└ @ Main In[11]:23
┌ Info: searching shortest path (greedy approach) between vertices 1 and 29
└ @ Main In[9]:2
┌ Info: --- exploration reached a dead end
└ @ Main In[9]:12
┌ Info: --- explored path:
│ sp = UInt32[0x00000001, 0x00000003, 0x00000009, 0x0000166f, 0x000024a9, 0x000014a1, 0x000014f9, 0x00002ccd, 0x000000ab, 0x00000679, 0x000012b9, 0x00000c13, 0x00000c0d, 0x000007a4, 0x00000082, 0x00000d4a, 0x0000064f, 0x000029d5, 0x00003180, 0x000021e8]
└ @ Main In[9]:13
┌ Info: ----- SP (Djikstra):
│ convert(Array{Int64, 1}, paths[1]) = [1, 3, 9, 5743, 9385, 8405, 1499, 171, 1657, 4793, 3091, 11219, 12661, 1514, 1687, 1685, 1684, 29]
└ @ Main In[11]:36
┌ Info: ----- SP (DF):
│ convert(Array{Int64, 1}, sp) = [1, 3, 9, 5743, 9385, 5281, 5369, 11469, 171, 1657, 4793, 3091, 3085, 1956, 130, 3402, 1615, 10709, 12672, 8680]
└ @ Main In[11]:46
┌ Info: computing personalized Pagerank for target node source t:
│ t = 30
└ @ Main In[11]:18
0.186513 seconds (2.07 k allocations: 273.056 MiB, 4.52% gc time)
┌ Info: computing DF
└ @ Main In[11]:23
┌ Info: searching shortest path (greedy approach) between vertices 1 and 30
└ @ Main In[9]:2
┌ Info: --- exploration reached a dead end
└ @ Main In[9]:12
┌ Info: --- explored path:
│ sp = UInt32[0x00000001, 0x00000003, 0x00000009, 0x0000166f, 0x000024a9, 0x000014a1, 0x000014f9, 0x00002ccd, 0x000000ab, 0x00000679, 0x000012b9, 0x00000c13, 0x00000c0d, 0x000007a4, 0x00000082, 0x00000d4a, 0x0000064f, 0x000029d5, 0x00003180, 0x000021e8]
└ @ Main In[9]:13
┌ Info: ----- SP (Djikstra):
│ convert(Array{Int64, 1}, paths[1]) = [1, 3, 9, 5743, 9385, 8405, 1499, 171, 1657, 4793, 3091, 11219, 12687, 3374, 2820, 1654, 1768, 30]
└ @ Main In[11]:36
┌ Info: ----- SP (DF):
│ convert(Array{Int64, 1}, sp) = [1, 3, 9, 5743, 9385, 5281, 5369, 11469, 171, 1657, 4793, 3091, 3085, 1956, 130, 3402, 1615, 10709, 12672, 8680]
└ @ Main In[11]:46
┌ Info: computing personalized Pagerank for target node source t:
│ t = 31
└ @ Main In[11]:18
0.182053 seconds (2.02 k allocations: 265.676 MiB, 4.66% gc time)
┌ Info: computing DF
└ @ Main In[11]:23
┌ Info: searching shortest path (greedy approach) between vertices 1 and 31
└ @ Main In[9]:2
┌ Info: --- exploration reached a dead end
└ @ Main In[9]:12
┌ Info: --- explored path:
│ sp = UInt32[0x00000001, 0x00000003, 0x00000009, 0x0000166f, 0x000024a9, 0x000014a1, 0x000014f9, 0x00002ccd, 0x000000ab, 0x00000679, 0x000012b9, 0x00000c13, 0x00000c0d, 0x000007a4, 0x00000082, 0x00000d4a, 0x0000064f, 0x000029d5, 0x00003180, 0x000021e8]
└ @ Main In[9]:13
┌ Info: ----- SP (Djikstra):
│ convert(Array{Int64, 1}, paths[1]) = [1, 3, 9, 5743, 9385, 8405, 1499, 171, 1657, 4793, 3091, 11219, 12661, 1514, 18, 40, 31]
└ @ Main In[11]:36
┌ Info: ----- SP (DF):
│ convert(Array{Int64, 1}, sp) = [1, 3, 9, 5743, 9385, 5281, 5369, 11469, 171, 1657, 4793, 3091, 3085, 1956, 130, 3402, 1615, 10709, 12672, 8680]
└ @ Main In[11]:46
┌ Info: computing personalized Pagerank for target node source t:
│ t = 32
└ @ Main In[11]:18
0.183582 seconds (2.02 k allocations: 265.676 MiB, 4.83% gc time)
┌ Info: computing DF
└ @ Main In[11]:23
┌ Info: searching shortest path (greedy approach) between vertices 1 and 32
└ @ Main In[9]:2
┌ Info: --- exploration reached a dead end
└ @ Main In[9]:12
┌ Info: --- explored path:
│ sp = UInt32[0x00000001, 0x00000003, 0x00000009, 0x0000166f, 0x000024a9, 0x000014a1, 0x000014f9, 0x00002ccd, 0x000000ab, 0x00000679, 0x000012b9, 0x00000c13, 0x00000c0d, 0x000007a4, 0x00000082, 0x00000d4a, 0x0000064f, 0x000029d5, 0x00003180, 0x000021e8]
└ @ Main In[9]:13
┌ Info: ----- SP (Djikstra):
│ convert(Array{Int64, 1}, paths[1]) = [1, 3, 9, 5743, 9385, 8405, 1499, 171, 1657, 4793, 3091, 11219, 12661, 1514, 18, 40, 32]
└ @ Main In[11]:36
┌ Info: ----- SP (DF):
│ convert(Array{Int64, 1}, sp) = [1, 3, 9, 5743, 9385, 5281, 5369, 11469, 171, 1657, 4793, 3091, 3085, 1956, 130, 3402, 1615, 10709, 12672, 8680]
└ @ Main In[11]:46
┌ Info: computing personalized Pagerank for target node source t:
│ t = 33
└ @ Main In[11]:18
0.193227 seconds (2.10 k allocations: 276.746 MiB, 4.88% gc time)
┌ Info: computing DF
└ @ Main In[11]:23
┌ Info: searching shortest path (greedy approach) between vertices 1 and 33
└ @ Main In[9]:2
┌ Info: --- exploration reached a dead end
└ @ Main In[9]:12
┌ Info: --- explored path:
│ sp = UInt32[0x00000001, 0x00000003, 0x00000009, 0x0000166f, 0x000024a9, 0x000014a1, 0x000014f9, 0x00002ccd, 0x000000ab, 0x00000679, 0x000012b9, 0x00000c13, 0x00000c0d, 0x000007a4, 0x00000082, 0x00000d4a, 0x0000064f, 0x000029d5, 0x00003180, 0x000021e8]
└ @ Main In[9]:13
┌ Info: ----- SP (Djikstra):
│ convert(Array{Int64, 1}, paths[1]) = [1, 3, 9, 5743, 9385, 8405, 1499, 171, 1657, 4793, 3091, 11219, 12661, 1514, 1368, 1383, 33]
└ @ Main In[11]:36
┌ Info: ----- SP (DF):
│ convert(Array{Int64, 1}, sp) = [1, 3, 9, 5743, 9385, 5281, 5369, 11469, 171, 1657, 4793, 3091, 3085, 1956, 130, 3402, 1615, 10709, 12672, 8680]
└ @ Main In[11]:46
┌ Info: computing personalized Pagerank for target node source t:
│ t = 34
└ @ Main In[11]:18
0.186569 seconds (2.10 k allocations: 276.746 MiB, 4.58% gc time)
┌ Info: computing DF
└ @ Main In[11]:23
┌ Info: searching shortest path (greedy approach) between vertices 1 and 34
└ @ Main In[9]:2
┌ Info: --- exploration reached a dead end
└ @ Main In[9]:12
┌ Info: --- explored path:
│ sp = UInt32[0x00000001, 0x00000003, 0x00000009, 0x0000166f, 0x000024a9, 0x000014a1, 0x000014f9, 0x00002ccd, 0x000000ab, 0x00000679, 0x000012b9, 0x00000c13, 0x00000c0d, 0x000007a4, 0x00000082, 0x00000d4a, 0x0000064f, 0x000029d5, 0x00003180, 0x000021e8]
└ @ Main In[9]:13
┌ Info: ----- SP (Djikstra):
│ convert(Array{Int64, 1}, paths[1]) = [1, 3, 9, 5743, 9385, 8405, 1499, 171, 1657, 4793, 3091, 11219, 12661, 1514, 18, 40, 34]
└ @ Main In[11]:36
┌ Info: ----- SP (DF):
│ convert(Array{Int64, 1}, sp) = [1, 3, 9, 5743, 9385, 5281, 5369, 11469, 171, 1657, 4793, 3091, 3085, 1956, 130, 3402, 1615, 10709, 12672, 8680]
└ @ Main In[11]:46
┌ Info: computing personalized Pagerank for target node source t:
│ t = 35
└ @ Main In[11]:18
0.186933 seconds (2.10 k allocations: 276.746 MiB, 4.83% gc time)
┌ Info: computing DF
└ @ Main In[11]:23
┌ Info: searching shortest path (greedy approach) between vertices 1 and 35
└ @ Main In[9]:2
┌ Info: --- exploration reached a dead end
└ @ Main In[9]:12
┌ Info: --- explored path:
│ sp = UInt32[0x00000001, 0x00000003, 0x00000009, 0x0000166f, 0x000024a9, 0x000014a1, 0x000014f9, 0x00002ccd, 0x000000ab, 0x00000679, 0x000012b9, 0x00000c13, 0x00000c0d, 0x000007a4, 0x00000082, 0x00000d4a, 0x0000064f, 0x000029d5, 0x00003180, 0x000021e8]
└ @ Main In[9]:13
┌ Info: ----- SP (Djikstra):
│ convert(Array{Int64, 1}, paths[1]) = [1, 3, 9, 5743, 9385, 8405, 1499, 171, 1657, 4793, 3091, 11219, 12661, 1514, 1368, 1383, 36, 35]
└ @ Main In[11]:36
┌ Info: ----- SP (DF):
│ convert(Array{Int64, 1}, sp) = [1, 3, 9, 5743, 9385, 5281, 5369, 11469, 171, 1657, 4793, 3091, 3085, 1956, 130, 3402, 1615, 10709, 12672, 8680]
└ @ Main In[11]:46
┌ Info: computing personalized Pagerank for target node source t:
│ t = 36
└ @ Main In[11]:18
0.190590 seconds (2.07 k allocations: 273.056 MiB, 4.70% gc time)
┌ Info: computing DF
└ @ Main In[11]:23
┌ Info: searching shortest path (greedy approach) between vertices 1 and 36
└ @ Main In[9]:2
┌ Info: --- exploration reached a dead end
└ @ Main In[9]:12
┌ Info: --- explored path:
│ sp = UInt32[0x00000001, 0x00000003, 0x00000009, 0x0000166f, 0x000024a9, 0x000014a1, 0x000014f9, 0x00002ccd, 0x000000ab, 0x00000679, 0x000012b9, 0x00000c13, 0x00000c0d, 0x000007a4, 0x00000082, 0x00000d4a, 0x0000064f, 0x000029d5, 0x00003180, 0x000021e8]
└ @ Main In[9]:13
┌ Info: ----- SP (Djikstra):
│ convert(Array{Int64, 1}, paths[1]) = [1, 3, 9, 5743, 9385, 8405, 1499, 171, 1657, 4793, 3091, 11219, 12661, 1514, 1368, 1383, 36]
└ @ Main In[11]:36
┌ Info: ----- SP (DF):
│ convert(Array{Int64, 1}, sp) = [1, 3, 9, 5743, 9385, 5281, 5369, 11469, 171, 1657, 4793, 3091, 3085, 1956, 130, 3402, 1615, 10709, 12672, 8680]
└ @ Main In[11]:46
┌ Info: computing personalized Pagerank for target node source t:
│ t = 37
└ @ Main In[11]:18
0.189104 seconds (2.10 k allocations: 276.746 MiB, 4.71% gc time)
┌ Info: computing DF
└ @ Main In[11]:23
┌ Info: searching shortest path (greedy approach) between vertices 1 and 37
└ @ Main In[9]:2
┌ Info: --- exploration reached a dead end
└ @ Main In[9]:12
┌ Info: --- explored path:
│ sp = UInt32[0x00000001, 0x00000003, 0x00000009, 0x0000166f, 0x000024a9, 0x000014a1, 0x000014f9, 0x00002ccd, 0x000000ab, 0x00000679, 0x000012b9, 0x00000c13, 0x00000c0d, 0x000007a4, 0x00000082, 0x00000d4a, 0x0000064f, 0x000029d5, 0x00003180, 0x000021e8]
└ @ Main In[9]:13
┌ Info: ----- SP (Djikstra):
│ convert(Array{Int64, 1}, paths[1]) = [1, 3, 9, 5743, 9385, 8405, 1499, 171, 1657, 4793, 3091, 4997, 5005, 3869, 1367, 38, 37]
└ @ Main In[11]:36
┌ Info: ----- SP (DF):
│ convert(Array{Int64, 1}, sp) = [1, 3, 9, 5743, 9385, 5281, 5369, 11469, 171, 1657, 4793, 3091, 3085, 1956, 130, 3402, 1615, 10709, 12672, 8680]
└ @ Main In[11]:46
┌ Info: computing personalized Pagerank for target node source t:
│ t = 38
└ @ Main In[11]:18
0.191292 seconds (2.07 k allocations: 273.056 MiB, 4.87% gc time)
┌ Info: computing DF
└ @ Main In[11]:23
┌ Info: searching shortest path (greedy approach) between vertices 1 and 38
└ @ Main In[9]:2
┌ Info: --- exploration reached a dead end
└ @ Main In[9]:12
┌ Info: --- explored path:
│ sp = UInt32[0x00000001, 0x00000003, 0x00000009, 0x0000166f, 0x000024a9, 0x000014a1, 0x000014f9, 0x00002ccd, 0x000000ab, 0x00000679, 0x000012b9, 0x00000c13, 0x00000c0d, 0x000007a4, 0x00000082, 0x00000d4a, 0x0000064f, 0x000029d5, 0x00003180, 0x000021e8]
└ @ Main In[9]:13
┌ Info: ----- SP (Djikstra):
│ convert(Array{Int64, 1}, paths[1]) = [1, 3, 9, 5743, 9385, 8405, 1499, 171, 1657, 4793, 3091, 4997, 5005, 3869, 1367, 38]
└ @ Main In[11]:36
┌ Info: ----- SP (DF):
│ convert(Array{Int64, 1}, sp) = [1, 3, 9, 5743, 9385, 5281, 5369, 11469, 171, 1657, 4793, 3091, 3085, 1956, 130, 3402, 1615, 10709, 12672, 8680]
└ @ Main In[11]:46
┌ Info: computing personalized Pagerank for target node source t:
│ t = 39
└ @ Main In[11]:18
0.189520 seconds (2.07 k allocations: 273.056 MiB, 4.63% gc time)
┌ Info: computing DF
└ @ Main In[11]:23
┌ Info: searching shortest path (greedy approach) between vertices 1 and 39
└ @ Main In[9]:2
┌ Info: --- exploration reached a dead end
└ @ Main In[9]:12
┌ Info: --- explored path:
│ sp = UInt32[0x00000001, 0x00000003, 0x00000009, 0x0000166f, 0x000024a9, 0x000014a1, 0x000014f9, 0x00002ccd, 0x000000ab, 0x00000679, 0x000012b9, 0x00000c13, 0x00000c0d, 0x000007a4, 0x00000082, 0x00000d4a, 0x0000064f, 0x000029d5, 0x00003180, 0x000021e8]
└ @ Main In[9]:13
┌ Info: ----- SP (Djikstra):
│ convert(Array{Int64, 1}, paths[1]) = [1, 3, 9, 5743, 9385, 8405, 1499, 171, 1657, 4793, 3091, 11219, 9040, 190, 46, 39]
└ @ Main In[11]:36
┌ Info: ----- SP (DF):
│ convert(Array{Int64, 1}, sp) = [1, 3, 9, 5743, 9385, 5281, 5369, 11469, 171, 1657, 4793, 3091, 3085, 1956, 130, 3402, 1615, 10709, 12672, 8680]
└ @ Main In[11]:46
┌ Info: computing personalized Pagerank for target node source t:
│ t = 40
└ @ Main In[11]:18
0.181270 seconds (2.02 k allocations: 265.676 MiB, 4.95% gc time)
┌ Info: computing DF
└ @ Main In[11]:23
┌ Info: searching shortest path (greedy approach) between vertices 1 and 40
└ @ Main In[9]:2
┌ Info: --- exploration reached a dead end
└ @ Main In[9]:12
┌ Info: --- explored path:
│ sp = UInt32[0x00000001, 0x00000003, 0x00000009, 0x0000166f, 0x000024a9, 0x000014a1, 0x000014f9, 0x00002ccd, 0x000000ab, 0x00000679, 0x000012b9, 0x00000c13, 0x00000c0d, 0x000007a4, 0x00000082, 0x00000d4a, 0x0000064f, 0x000029d5, 0x00003180, 0x000021e8]
└ @ Main In[9]:13
┌ Info: ----- SP (Djikstra):
│ convert(Array{Int64, 1}, paths[1]) = [1, 3, 9, 5743, 9385, 8405, 1499, 171, 1657, 4793, 3091, 11219, 12661, 1514, 18, 40]
└ @ Main In[11]:36
┌ Info: ----- SP (DF):
│ convert(Array{Int64, 1}, sp) = [1, 3, 9, 5743, 9385, 5281, 5369, 11469, 171, 1657, 4793, 3091, 3085, 1956, 130, 3402, 1615, 10709, 12672, 8680]
└ @ Main In[11]:46
┌ Info: computing personalized Pagerank for target node source t:
│ t = 41
└ @ Main In[11]:18
0.188482 seconds (2.10 k allocations: 276.746 MiB, 5.00% gc time)
┌ Info: computing DF
└ @ Main In[11]:23
┌ Info: searching shortest path (greedy approach) between vertices 1 and 41
└ @ Main In[9]:2
┌ Info: --- exploration reached a dead end
└ @ Main In[9]:12
┌ Info: --- explored path:
│ sp = UInt32[0x00000001, 0x00000003, 0x00000009, 0x0000166f, 0x000024a9, 0x000014a1, 0x000014f9, 0x00002ccd, 0x000000ab, 0x00000679, 0x000012b9, 0x00000c13, 0x00000c0d, 0x000007a4, 0x00000082, 0x00000d4a, 0x0000064f, 0x000029d5, 0x00003180, 0x000021e8]
└ @ Main In[9]:13
┌ Info: ----- SP (Djikstra):
│ convert(Array{Int64, 1}, paths[1]) = [1, 3, 9, 5743, 9385, 8405, 1499, 171, 1657, 4793, 3091, 11219, 12661, 1514, 18, 40, 34, 41]
└ @ Main In[11]:36
┌ Info: ----- SP (DF):
│ convert(Array{Int64, 1}, sp) = [1, 3, 9, 5743, 9385, 5281, 5369, 11469, 171, 1657, 4793, 3091, 3085, 1956, 130, 3402, 1615, 10709, 12672, 8680]
└ @ Main In[11]:46
┌ Info: computing personalized Pagerank for target node source t:
│ t = 42
└ @ Main In[11]:18
0.196859 seconds (2.10 k allocations: 276.746 MiB, 4.37% gc time)
┌ Info: computing DF
└ @ Main In[11]:23
┌ Info: searching shortest path (greedy approach) between vertices 1 and 42
└ @ Main In[9]:2
┌ Info: --- exploration reached a dead end
└ @ Main In[9]:12
┌ Info: --- explored path:
│ sp = UInt32[0x00000001, 0x00000003, 0x00000009, 0x0000166f, 0x000024a9, 0x000014a1, 0x000014f9, 0x00002ccd, 0x000000ab, 0x00000679, 0x000012b9, 0x00000c13, 0x00000c0d, 0x000007a4, 0x00000082, 0x00000d4a, 0x0000064f, 0x000029d5, 0x00003180, 0x000021e8]
└ @ Main In[9]:13
┌ Info: ----- SP (Djikstra):
│ convert(Array{Int64, 1}, paths[1]) = [1, 3, 9, 5743, 9385, 8405, 1499, 171, 1657, 4793, 3091, 11219, 12687, 10152, 10158, 10163, 195, 20, 42]
└ @ Main In[11]:36
┌ Info: ----- SP (DF):
│ convert(Array{Int64, 1}, sp) = [1, 3, 9, 5743, 9385, 5281, 5369, 11469, 171, 1657, 4793, 3091, 3085, 1956, 130, 3402, 1615, 10709, 12672, 8680]
└ @ Main In[11]:46
┌ Info: computing personalized Pagerank for target node source t:
│ t = 43
└ @ Main In[11]:18
0.251711 seconds (2.07 k allocations: 273.056 MiB, 28.73% gc time)
┌ Info: computing DF
└ @ Main In[11]:23
┌ Info: searching shortest path (greedy approach) between vertices 1 and 43
└ @ Main In[9]:2
┌ Info: --- exploration reached a dead end
└ @ Main In[9]:12
┌ Info: --- explored path:
│ sp = UInt32[0x00000001, 0x00000003, 0x00000009, 0x0000166f, 0x000024a9, 0x000014a1, 0x000014f9, 0x00002ccd, 0x000000ab, 0x00000679, 0x000012b9, 0x00000c13, 0x00000c0d, 0x000007a4, 0x00000082, 0x00000d4a, 0x0000064f, 0x000029d5, 0x00003180, 0x000021e8]
└ @ Main In[9]:13
┌ Info: ----- SP (Djikstra):
│ convert(Array{Int64, 1}, paths[1]) = [1, 3, 9, 5743, 9385, 8405, 1499, 171, 1657, 4793, 3091, 4997, 5005, 3869, 1367, 43]
└ @ Main In[11]:36
┌ Info: ----- SP (DF):
│ convert(Array{Int64, 1}, sp) = [1, 3, 9, 5743, 9385, 5281, 5369, 11469, 171, 1657, 4793, 3091, 3085, 1956, 130, 3402, 1615, 10709, 12672, 8680]
└ @ Main In[11]:46
┌ Info: computing personalized Pagerank for target node source t:
│ t = 44
└ @ Main In[11]:18
0.184364 seconds (2.07 k allocations: 273.056 MiB, 4.86% gc time)
┌ Info: computing DF
└ @ Main In[11]:23
┌ Info: searching shortest path (greedy approach) between vertices 1 and 44
└ @ Main In[9]:2
┌ Info: --- exploration reached a dead end
└ @ Main In[9]:12
┌ Info: --- explored path:
│ sp = UInt32[0x00000001, 0x00000003, 0x00000009, 0x0000166f, 0x000024a9, 0x000014a1, 0x000014f9, 0x00002ccd, 0x000000ab, 0x00000679, 0x000012b9, 0x00000c13, 0x00000c0d, 0x000007a4, 0x00000082, 0x00000d4a, 0x0000064f, 0x000029d5, 0x00003180, 0x000021e8]
└ @ Main In[9]:13
┌ Info: ----- SP (Djikstra):
│ convert(Array{Int64, 1}, paths[1]) = [1, 3, 9, 5743, 9385, 8405, 1499, 171, 1657, 4793, 3091, 11219, 12687, 10152, 10158, 10163, 195, 20, 44]
└ @ Main In[11]:36
┌ Info: ----- SP (DF):
│ convert(Array{Int64, 1}, sp) = [1, 3, 9, 5743, 9385, 5281, 5369, 11469, 171, 1657, 4793, 3091, 3085, 1956, 130, 3402, 1615, 10709, 12672, 8680]
└ @ Main In[11]:46
┌ Info: computing personalized Pagerank for target node source t:
│ t = 45
└ @ Main In[11]:18
0.185817 seconds (2.07 k allocations: 273.056 MiB, 4.40% gc time)
┌ Info: computing DF
└ @ Main In[11]:23
┌ Info: searching shortest path (greedy approach) between vertices 1 and 45
└ @ Main In[9]:2
┌ Info: --- exploration reached a dead end
└ @ Main In[9]:12
┌ Info: --- explored path:
│ sp = UInt32[0x00000001, 0x00000003, 0x00000009, 0x0000166f, 0x000024a9, 0x000014a1, 0x000014f9, 0x00002ccd, 0x000000ab, 0x00000679, 0x000012b9, 0x00000c13, 0x00000c0d, 0x000007a4, 0x00000082, 0x00000d4a, 0x0000064f, 0x000029d5, 0x00003180, 0x000021e8]
└ @ Main In[9]:13
┌ Info: ----- SP (Djikstra):
│ convert(Array{Int64, 1}, paths[1]) = [1, 3, 9, 5743, 9385, 8405, 1499, 171, 1657, 4793, 3091, 11219, 9040, 190, 46, 45]
└ @ Main In[11]:36
┌ Info: ----- SP (DF):
│ convert(Array{Int64, 1}, sp) = [1, 3, 9, 5743, 9385, 5281, 5369, 11469, 171, 1657, 4793, 3091, 3085, 1956, 130, 3402, 1615, 10709, 12672, 8680]
└ @ Main In[11]:46
┌ Info: computing personalized Pagerank for target node source t:
│ t = 46
└ @ Main In[11]:18
0.181425 seconds (2.02 k allocations: 265.676 MiB, 4.51% gc time)
┌ Info: computing DF
└ @ Main In[11]:23
┌ Info: searching shortest path (greedy approach) between vertices 1 and 46
└ @ Main In[9]:2
┌ Info: --- exploration reached a dead end
└ @ Main In[9]:12
┌ Info: --- explored path:
│ sp = UInt32[0x00000001, 0x00000003, 0x00000009, 0x0000166f, 0x000024a9, 0x000014a1, 0x000014f9, 0x00002ccd, 0x000000ab, 0x00000679, 0x000012b9, 0x00000c13, 0x00000c0d, 0x000007a4, 0x00000082, 0x00000d4a, 0x0000064f, 0x000029d5, 0x00003180, 0x000021e8]
└ @ Main In[9]:13
┌ Info: ----- SP (Djikstra):
│ convert(Array{Int64, 1}, paths[1]) = [1, 3, 9, 5743, 9385, 8405, 1499, 171, 1657, 4793, 3091, 11219, 9040, 190, 46]
└ @ Main In[11]:36
┌ Info: ----- SP (DF):
│ convert(Array{Int64, 1}, sp) = [1, 3, 9, 5743, 9385, 5281, 5369, 11469, 171, 1657, 4793, 3091, 3085, 1956, 130, 3402, 1615, 10709, 12672, 8680]
└ @ Main In[11]:46
┌ Info: computing personalized Pagerank for target node source t:
│ t = 47
└ @ Main In[11]:18
0.178433 seconds (1.99 k allocations: 261.986 MiB, 4.51% gc time)
┌ Info: computing DF
└ @ Main In[11]:23
┌ Info: searching shortest path (greedy approach) between vertices 1 and 47
└ @ Main In[9]:2
┌ Info: --- exploration reached a dead end
└ @ Main In[9]:12
┌ Info: --- explored path:
│ sp = UInt32[0x00000001, 0x00000003, 0x00000009, 0x0000166f, 0x000024a9, 0x000014a1, 0x000014f9, 0x00002ccd, 0x000000ab, 0x00000679, 0x000012b9, 0x00000c13, 0x00000c0d, 0x000007a4, 0x00000082, 0x00000d4a, 0x0000064f, 0x000029d5, 0x00003180, 0x000021e8]
└ @ Main In[9]:13
┌ Info: ----- SP (Djikstra):
│ convert(Array{Int64, 1}, paths[1]) = [1, 3, 9, 5743, 9385, 8405, 1499, 171, 1657, 4793, 3091, 11219, 9040, 190, 47]
└ @ Main In[11]:36
┌ Info: ----- SP (DF):
│ convert(Array{Int64, 1}, sp) = [1, 3, 9, 5743, 9385, 5281, 5369, 11469, 171, 1657, 4793, 3091, 3085, 1956, 130, 3402, 1615, 10709, 12672, 8680]
└ @ Main In[11]:46
┌ Info: computing personalized Pagerank for target node source t:
│ t = 48
└ @ Main In[11]:18
0.178095 seconds (1.99 k allocations: 261.986 MiB, 4.76% gc time)
┌ Info: computing DF
└ @ Main In[11]:23
┌ Info: searching shortest path (greedy approach) between vertices 1 and 48
└ @ Main In[9]:2
┌ Info: --- exploration reached a dead end
└ @ Main In[9]:12
┌ Info: --- explored path:
│ sp = UInt32[0x00000001, 0x00000003, 0x00000009, 0x0000166f, 0x000024a9, 0x000014a1, 0x000014f9, 0x00002ccd, 0x000000ab, 0x00000679, 0x000012b9, 0x00000c13, 0x00000c0d, 0x000007a4, 0x00000082, 0x00000d4a, 0x0000064f, 0x000029d5, 0x00003180, 0x000021e8]
└ @ Main In[9]:13
┌ Info: ----- SP (Djikstra):
│ convert(Array{Int64, 1}, paths[1]) = [1, 3, 9, 5743, 9385, 8405, 1499, 171, 1657, 4793, 3091, 11219, 9040, 190, 48]
└ @ Main In[11]:36
┌ Info: ----- SP (DF):
│ convert(Array{Int64, 1}, sp) = [1, 3, 9, 5743, 9385, 5281, 5369, 11469, 171, 1657, 4793, 3091, 3085, 1956, 130, 3402, 1615, 10709, 12672, 8680]
└ @ Main In[11]:46
┌ Info: computing personalized Pagerank for target node source t:
│ t = 49
└ @ Main In[11]:18
0.178255 seconds (2.02 k allocations: 265.676 MiB, 4.77% gc time)
┌ Info: computing DF
└ @ Main In[11]:23
┌ Info: searching shortest path (greedy approach) between vertices 1 and 49
└ @ Main In[9]:2
┌ Info: --- exploration reached a dead end
└ @ Main In[9]:12
┌ Info: --- explored path:
│ sp = UInt32[0x00000001, 0x00000003, 0x00000009, 0x0000166f, 0x000024a9, 0x000014a1, 0x000014f9, 0x00002ccd, 0x000000ab, 0x00000679, 0x000012b9, 0x00000c13, 0x00000c0d, 0x000007a4, 0x00000082, 0x00000d4a, 0x0000064f, 0x000029d5, 0x00003180, 0x000021e8]
└ @ Main In[9]:13
┌ Info: ----- SP (Djikstra):
│ convert(Array{Int64, 1}, paths[1]) = [1, 3, 9, 5743, 9385, 8405, 1499, 171, 1657, 4793, 3091, 11219, 9040, 190, 49]
└ @ Main In[11]:36
┌ Info: ----- SP (DF):
│ convert(Array{Int64, 1}, sp) = [1, 3, 9, 5743, 9385, 5281, 5369, 11469, 171, 1657, 4793, 3091, 3085, 1956, 130, 3402, 1615, 10709, 12672, 8680]
└ @ Main In[11]:46
┌ Info: computing personalized Pagerank for target node source t:
│ t = 50
└ @ Main In[11]:18
0.184855 seconds (2.10 k allocations: 276.746 MiB, 4.46% gc time)
┌ Info: computing DF
└ @ Main In[11]:23
┌ Info: searching shortest path (greedy approach) between vertices 1 and 50
└ @ Main In[9]:2
┌ Info: --- exploration reached a dead end
└ @ Main In[9]:12
┌ Info: --- explored path:
│ sp = UInt32[0x00000001, 0x00000003, 0x00000009, 0x0000166f, 0x000024a9, 0x000014a1, 0x000014f9, 0x00002ccd, 0x000000ab, 0x00000679, 0x000012b9, 0x00000c13, 0x00000c0d, 0x000007a4, 0x00000082, 0x00000d4a, 0x0000064f, 0x000029d5, 0x00003180, 0x000021e8]
└ @ Main In[9]:13
┌ Info: ----- SP (Djikstra):
│ convert(Array{Int64, 1}, paths[1]) = [1, 3, 9, 5743, 9385, 8405, 1499, 171, 1657, 4793, 3091, 11219, 12661, 1514, 1368, 1383, 4771, 50]
└ @ Main In[11]:36
┌ Info: ----- SP (DF):
│ convert(Array{Int64, 1}, sp) = [1, 3, 9, 5743, 9385, 5281, 5369, 11469, 171, 1657, 4793, 3091, 3085, 1956, 130, 3402, 1615, 10709, 12672, 8680]
└ @ Main In[11]:46
┌ Info: computing personalized Pagerank for target node source t:
│ t = 51
└ @ Main In[11]:18
0.193994 seconds (2.13 k allocations: 280.436 MiB, 4.64% gc time)
┌ Info: computing DF
└ @ Main In[11]:23
┌ Info: searching shortest path (greedy approach) between vertices 1 and 51
└ @ Main In[9]:2
┌ Info: --- exploration reached a dead end
└ @ Main In[9]:12
┌ Info: --- explored path:
│ sp = UInt32[0x00000001, 0x00000003, 0x00000009, 0x0000166f, 0x000024a9, 0x000014a1, 0x000014f9, 0x00002ccd, 0x000000ab, 0x00000679, 0x000012b9, 0x00000c13, 0x00000c0d, 0x000007a4, 0x00000082, 0x00000d4a, 0x0000064f, 0x000029d5, 0x00003180, 0x000021e8]
└ @ Main In[9]:13
┌ Info: ----- SP (Djikstra):
│ convert(Array{Int64, 1}, paths[1]) = [1, 3, 9, 5743, 9385, 8405, 1499, 171, 1657, 4793, 3091, 11219, 12687, 10152, 10158, 10163, 195, 20, 51]
└ @ Main In[11]:36
┌ Info: ----- SP (DF):
│ convert(Array{Int64, 1}, sp) = [1, 3, 9, 5743, 9385, 5281, 5369, 11469, 171, 1657, 4793, 3091, 3085, 1956, 130, 3402, 1615, 10709, 12672, 8680]
└ @ Main In[11]:46
┌ Info: computing personalized Pagerank for target node source t:
│ t = 52
└ @ Main In[11]:18
0.185910 seconds (2.07 k allocations: 273.056 MiB, 4.54% gc time)
┌ Info: computing DF
└ @ Main In[11]:23
┌ Info: searching shortest path (greedy approach) between vertices 1 and 52
└ @ Main In[9]:2
┌ Info: --- exploration reached a dead end
└ @ Main In[9]:12
┌ Info: --- explored path:
│ sp = UInt32[0x00000001, 0x00000003, 0x00000009, 0x0000166f, 0x000024a9, 0x000014a1, 0x000014f9, 0x00002ccd, 0x000000ab, 0x00000679, 0x000012b9, 0x00000c13, 0x00000c0d, 0x000007a4, 0x00000082, 0x00000d4a, 0x0000064f, 0x000029d5, 0x00003180, 0x000021e8]
└ @ Main In[9]:13
┌ Info: ----- SP (Djikstra):
│ convert(Array{Int64, 1}, paths[1]) = [1, 3, 9, 5743, 9385, 8405, 1499, 171, 1657, 4793, 3091, 11219, 12661, 1514, 1687, 1685, 52]
└ @ Main In[11]:36
┌ Info: ----- SP (DF):
│ convert(Array{Int64, 1}, sp) = [1, 3, 9, 5743, 9385, 5281, 5369, 11469, 171, 1657, 4793, 3091, 3085, 1956, 130, 3402, 1615, 10709, 12672, 8680]
└ @ Main In[11]:46
┌ Info: computing personalized Pagerank for target node source t:
│ t = 53
└ @ Main In[11]:18
0.179757 seconds (1.99 k allocations: 261.986 MiB, 4.98% gc time)
┌ Info: computing DF
└ @ Main In[11]:23
┌ Info: searching shortest path (greedy approach) between vertices 1 and 53
└ @ Main In[9]:2
┌ Info: --- exploration reached a dead end
└ @ Main In[9]:12
┌ Info: --- explored path:
│ sp = UInt32[0x00000001, 0x00000003, 0x00000009, 0x0000166f, 0x000024a9, 0x000014a1, 0x000014f9, 0x00002ccd, 0x000000ab, 0x00000679, 0x000012b9, 0x00000c13, 0x00000c0d, 0x000007a4, 0x00000082, 0x00000d4a, 0x0000064f, 0x000029d5, 0x00003180, 0x000021e8]
└ @ Main In[9]:13
┌ Info: ----- SP (Djikstra):
│ convert(Array{Int64, 1}, paths[1]) = [1, 3, 9, 5743, 9385, 8405, 1499, 171, 1657, 4793, 3091, 11219, 9040, 190, 53]
└ @ Main In[11]:36
┌ Info: ----- SP (DF):
│ convert(Array{Int64, 1}, sp) = [1, 3, 9, 5743, 9385, 5281, 5369, 11469, 171, 1657, 4793, 3091, 3085, 1956, 130, 3402, 1615, 10709, 12672, 8680]
└ @ Main In[11]:46
┌ Info: computing personalized Pagerank for target node source t:
│ t = 54
└ @ Main In[11]:18
0.209605 seconds (2.10 k allocations: 276.746 MiB, 4.58% gc time)
┌ Info: computing DF
└ @ Main In[11]:23
┌ Info: searching shortest path (greedy approach) between vertices 1 and 54
└ @ Main In[9]:2
┌ Info: --- exploration reached a dead end
└ @ Main In[9]:12
┌ Info: --- explored path:
│ sp = UInt32[0x00000001, 0x00000003, 0x00000009, 0x0000166f, 0x000024a9, 0x000014a1, 0x000014f9, 0x00002ccd, 0x000000ab, 0x00000679, 0x000012b9, 0x00000c13, 0x00000c0d, 0x000007a4, 0x00000082, 0x00000d4a, 0x0000064f, 0x000029d5, 0x00003180, 0x000021e8]
└ @ Main In[9]:13
┌ Info: ----- SP (Djikstra):
│ convert(Array{Int64, 1}, paths[1]) = [1, 3, 9, 5743, 9385, 8405, 1499, 171, 1657, 4793, 3091, 11219, 12687, 10152, 10158, 10163, 195, 20, 54]
└ @ Main In[11]:36
┌ Info: ----- SP (DF):
│ convert(Array{Int64, 1}, sp) = [1, 3, 9, 5743, 9385, 5281, 5369, 11469, 171, 1657, 4793, 3091, 3085, 1956, 130, 3402, 1615, 10709, 12672, 8680]
└ @ Main In[11]:46
┌ Info: computing personalized Pagerank for target node source t:
│ t = 55
└ @ Main In[11]:18
0.200021 seconds (2.10 k allocations: 276.746 MiB, 4.24% gc time)
┌ Info: computing DF
└ @ Main In[11]:23
┌ Info: searching shortest path (greedy approach) between vertices 1 and 55
└ @ Main In[9]:2
┌ Info: --- exploration reached a dead end
└ @ Main In[9]:12
┌ Info: --- explored path:
│ sp = UInt32[0x00000001, 0x00000003, 0x00000009, 0x0000166f, 0x000024a9, 0x000014a1, 0x000014f9, 0x00002ccd, 0x000000ab, 0x00000679, 0x000012b9, 0x00000c13, 0x00000c0d, 0x000007a4, 0x00000082, 0x00000d4a, 0x0000064f, 0x000029d5, 0x00003180, 0x000021e8]
└ @ Main In[9]:13
┌ Info: ----- SP (Djikstra):
│ convert(Array{Int64, 1}, paths[1]) = [1, 3, 9, 5743, 9385, 8405, 1499, 171, 1657, 4793, 3091, 11219, 12687, 10152, 10158, 10163, 195, 20, 55]
└ @ Main In[11]:36
┌ Info: ----- SP (DF):
│ convert(Array{Int64, 1}, sp) = [1, 3, 9, 5743, 9385, 5281, 5369, 11469, 171, 1657, 4793, 3091, 3085, 1956, 130, 3402, 1615, 10709, 12672, 8680]
└ @ Main In[11]:46
┌ Info: computing personalized Pagerank for target node source t:
│ t = 56
└ @ Main In[11]:18
0.185551 seconds (2.05 k allocations: 269.366 MiB, 4.42% gc time)
┌ Info: computing DF
└ @ Main In[11]:23
┌ Info: searching shortest path (greedy approach) between vertices 1 and 56
└ @ Main In[9]:2
┌ Info: --- exploration reached a dead end
└ @ Main In[9]:12
┌ Info: --- explored path:
│ sp = UInt32[0x00000001, 0x00000003, 0x00000009, 0x0000166f, 0x000024a9, 0x000014a1, 0x000014f9, 0x00002ccd, 0x000000ab, 0x00000679, 0x000012b9, 0x00000c13, 0x00000c0d, 0x000007a4, 0x00000082, 0x00000d4a, 0x0000064f, 0x000029d5, 0x00003180, 0x000021e8]
└ @ Main In[9]:13
┌ Info: ----- SP (Djikstra):
│ convert(Array{Int64, 1}, paths[1]) = [1, 3, 9, 5743, 9385, 8405, 1499, 171, 1657, 4793, 3091, 11219, 12687, 10152, 10158, 10163, 195, 20, 56]
└ @ Main In[11]:36
┌ Info: ----- SP (DF):
│ convert(Array{Int64, 1}, sp) = [1, 3, 9, 5743, 9385, 5281, 5369, 11469, 171, 1657, 4793, 3091, 3085, 1956, 130, 3402, 1615, 10709, 12672, 8680]
└ @ Main In[11]:46
┌ Info: computing personalized Pagerank for target node source t:
│ t = 57
└ @ Main In[11]:18
0.186862 seconds (2.10 k allocations: 276.746 MiB, 4.94% gc time)
┌ Info: computing DF
└ @ Main In[11]:23
┌ Info: searching shortest path (greedy approach) between vertices 1 and 57
└ @ Main In[9]:2
┌ Info: --- exploration reached a dead end
└ @ Main In[9]:12
┌ Info: --- explored path:
│ sp = UInt32[0x00000001, 0x00000003, 0x00000009, 0x0000166f, 0x000024a9, 0x000014a1, 0x000014f9, 0x00002ccd, 0x000000ab, 0x00000679, 0x000012b9, 0x00000c13, 0x00000c0d, 0x000007a4, 0x00000082, 0x00000d4a, 0x0000064f, 0x000029d5, 0x00003180, 0x000021e8]
└ @ Main In[9]:13
┌ Info: ----- SP (Djikstra):
│ convert(Array{Int64, 1}, paths[1]) = [1, 3, 9, 5743, 9385, 8405, 1499, 171, 1657, 4793, 3091, 11219, 12687, 10152, 10158, 10163, 195, 20, 57]
└ @ Main In[11]:36
┌ Info: ----- SP (DF):
│ convert(Array{Int64, 1}, sp) = [1, 3, 9, 5743, 9385, 5281, 5369, 11469, 171, 1657, 4793, 3091, 3085, 1956, 130, 3402, 1615, 10709, 12672, 8680]
└ @ Main In[11]:46
┌ Info: computing personalized Pagerank for target node source t:
│ t = 58
└ @ Main In[11]:18
0.187180 seconds (2.10 k allocations: 276.746 MiB, 4.43% gc time)
┌ Info: computing DF
└ @ Main In[11]:23
┌ Info: searching shortest path (greedy approach) between vertices 1 and 58
└ @ Main In[9]:2
┌ Info: --- exploration reached a dead end
└ @ Main In[9]:12
┌ Info: --- explored path:
│ sp = UInt32[0x00000001, 0x00000003, 0x00000009, 0x0000166f, 0x000024a9, 0x000014a1, 0x000014f9, 0x00002ccd, 0x000000ab, 0x00000679, 0x000012b9, 0x00000c13, 0x00000c0d, 0x000007a4, 0x00000082, 0x00000d4a, 0x0000064f, 0x000029d5, 0x00003180, 0x000021e8]
└ @ Main In[9]:13
┌ Info: ----- SP (Djikstra):
│ convert(Array{Int64, 1}, paths[1]) = [1, 3, 9, 5743, 9385, 8405, 1499, 171, 1657, 4793, 3091, 11219, 12687, 10152, 10158, 10163, 195, 20, 58]
└ @ Main In[11]:36
┌ Info: ----- SP (DF):
│ convert(Array{Int64, 1}, sp) = [1, 3, 9, 5743, 9385, 5281, 5369, 11469, 171, 1657, 4793, 3091, 3085, 1956, 130, 3402, 1615, 10709, 12672, 8680]
└ @ Main In[11]:46
┌ Info: computing personalized Pagerank for target node source t:
│ t = 59
└ @ Main In[11]:18
0.195920 seconds (2.10 k allocations: 276.746 MiB, 4.60% gc time)
┌ Info: computing DF
└ @ Main In[11]:23
┌ Info: searching shortest path (greedy approach) between vertices 1 and 59
└ @ Main In[9]:2
┌ Info: --- exploration reached a dead end
└ @ Main In[9]:12
┌ Info: --- explored path:
│ sp = UInt32[0x00000001, 0x00000003, 0x00000009, 0x0000166f, 0x000024a9, 0x000014a1, 0x000014f9, 0x00002ccd, 0x000000ab, 0x00000679, 0x000012b9, 0x00000c13, 0x00000c0d, 0x000007a4, 0x00000082, 0x00000d4a, 0x0000064f, 0x000029d5, 0x00003180, 0x000021e8]
└ @ Main In[9]:13
┌ Info: ----- SP (Djikstra):
│ convert(Array{Int64, 1}, paths[1]) = [1, 3, 9, 5743, 9385, 8405, 1499, 171, 1657, 4793, 3091, 11219, 12661, 1514, 1368, 1383, 4771, 59]
└ @ Main In[11]:36
┌ Info: ----- SP (DF):
│ convert(Array{Int64, 1}, sp) = [1, 3, 9, 5743, 9385, 5281, 5369, 11469, 171, 1657, 4793, 3091, 3085, 1956, 130, 3402, 1615, 10709, 12672, 8680]
└ @ Main In[11]:46
┌ Info: computing personalized Pagerank for target node source t:
│ t = 60
└ @ Main In[11]:18
0.199642 seconds (2.10 k allocations: 276.746 MiB, 4.34% gc time)
┌ Info: computing DF
└ @ Main In[11]:23
┌ Info: searching shortest path (greedy approach) between vertices 1 and 60
└ @ Main In[9]:2
┌ Info: --- exploration reached a dead end
└ @ Main In[9]:12
┌ Info: --- explored path:
│ sp = UInt32[0x00000001, 0x00000003, 0x00000009, 0x0000166f, 0x000024a9, 0x000014a1, 0x000014f9, 0x00002ccd, 0x000000ab, 0x00000679, 0x000012b9, 0x00000c13, 0x00000c0d, 0x000007a4, 0x00000082, 0x00000d4a, 0x0000064f, 0x000029d5, 0x00003180, 0x000021e8]
└ @ Main In[9]:13
┌ Info: ----- SP (Djikstra):
│ convert(Array{Int64, 1}, paths[1]) = [1, 3, 9, 5743, 9385, 8405, 1499, 171, 1657, 4793, 3091, 11219, 12687, 10152, 10158, 10163, 195, 20, 60]
└ @ Main In[11]:36
┌ Info: ----- SP (DF):
│ convert(Array{Int64, 1}, sp) = [1, 3, 9, 5743, 9385, 5281, 5369, 11469, 171, 1657, 4793, 3091, 3085, 1956, 130, 3402, 1615, 10709, 12672, 8680]
└ @ Main In[11]:46
┌ Info: computing personalized Pagerank for target node source t:
│ t = 61
└ @ Main In[11]:18
0.186543 seconds (2.07 k allocations: 273.056 MiB, 4.90% gc time)
┌ Info: computing DF
└ @ Main In[11]:23
┌ Info: searching shortest path (greedy approach) between vertices 1 and 61
└ @ Main In[9]:2
┌ Info: --- exploration reached a dead end
└ @ Main In[9]:12
┌ Info: --- explored path:
│ sp = UInt32[0x00000001, 0x00000003, 0x00000009, 0x0000166f, 0x000024a9, 0x000014a1, 0x000014f9, 0x00002ccd, 0x000000ab, 0x00000679, 0x000012b9, 0x00000c13, 0x00000c0d, 0x000007a4, 0x00000082, 0x00000d4a, 0x0000064f, 0x000029d5, 0x00003180, 0x000021e8]
└ @ Main In[9]:13
┌ Info: ----- SP (Djikstra):
│ convert(Array{Int64, 1}, paths[1]) = [1, 3, 9, 5743, 9385, 8405, 1499, 171, 1657, 4793, 3091, 11219, 12661, 1514, 1368, 1383, 61]
└ @ Main In[11]:36
┌ Info: ----- SP (DF):
│ convert(Array{Int64, 1}, sp) = [1, 3, 9, 5743, 9385, 5281, 5369, 11469, 171, 1657, 4793, 3091, 3085, 1956, 130, 3402, 1615, 10709, 12672, 8680]
└ @ Main In[11]:46
┌ Info: computing personalized Pagerank for target node source t:
│ t = 62
└ @ Main In[11]:18
0.187590 seconds (2.13 k allocations: 280.436 MiB, 4.38% gc time)
┌ Info: computing DF
└ @ Main In[11]:23
┌ Info: searching shortest path (greedy approach) between vertices 1 and 62
└ @ Main In[9]:2
┌ Info: --- exploration reached a dead end
└ @ Main In[9]:12
┌ Info: --- explored path:
│ sp = UInt32[0x00000001, 0x00000003, 0x00000009, 0x0000166f, 0x000024a9, 0x000014a1, 0x000014f9, 0x00002ccd, 0x000000ab, 0x00000679, 0x000012b9, 0x00000c13, 0x00000c0d, 0x000007a4, 0x00000082, 0x00000d4a, 0x0000064f, 0x000029d5, 0x00003180, 0x000021e8]
└ @ Main In[9]:13
┌ Info: ----- SP (Djikstra):
│ convert(Array{Int64, 1}, paths[1]) = [1, 3, 9, 5743, 9385, 8405, 1499, 171, 1657, 4793, 3091, 11219, 12687, 10152, 10158, 10163, 195, 1671, 62]
└ @ Main In[11]:36
┌ Info: ----- SP (DF):
│ convert(Array{Int64, 1}, sp) = [1, 3, 9, 5743, 9385, 5281, 5369, 11469, 171, 1657, 4793, 3091, 3085, 1956, 130, 3402, 1615, 10709, 12672, 8680]
└ @ Main In[11]:46
┌ Info: computing personalized Pagerank for target node source t:
│ t = 63
└ @ Main In[11]:18
0.185013 seconds (2.10 k allocations: 276.746 MiB, 4.89% gc time)
┌ Info: computing DF
└ @ Main In[11]:23
┌ Info: searching shortest path (greedy approach) between vertices 1 and 63
└ @ Main In[9]:2
┌ Info: --- exploration reached a dead end
└ @ Main In[9]:12
┌ Info: --- explored path:
│ sp = UInt32[0x00000001, 0x00000003, 0x00000009, 0x0000166f, 0x000024a9, 0x000014a1, 0x000014f9, 0x00002ccd, 0x000000ab, 0x00000679, 0x000012b9, 0x00000c13, 0x00000c0d, 0x000007a4, 0x00000082, 0x00000d4a, 0x0000064f, 0x000029d5, 0x00003180, 0x000021e8]
└ @ Main In[9]:13
┌ Info: ----- SP (Djikstra):
│ convert(Array{Int64, 1}, paths[1]) = [1, 3, 9, 5743, 9385, 8405, 1499, 171, 1657, 4793, 3091, 11219, 12687, 10152, 10158, 10163, 195, 20, 63]
└ @ Main In[11]:36
┌ Info: ----- SP (DF):
│ convert(Array{Int64, 1}, sp) = [1, 3, 9, 5743, 9385, 5281, 5369, 11469, 171, 1657, 4793, 3091, 3085, 1956, 130, 3402, 1615, 10709, 12672, 8680]
└ @ Main In[11]:46
┌ Info: computing personalized Pagerank for target node source t:
│ t = 64
└ @ Main In[11]:18
0.198284 seconds (2.10 k allocations: 276.746 MiB, 4.28% gc time)
┌ Info: computing DF
└ @ Main In[11]:23
┌ Info: searching shortest path (greedy approach) between vertices 1 and 64
└ @ Main In[9]:2
┌ Info: --- exploration reached a dead end
└ @ Main In[9]:12
┌ Info: --- explored path:
│ sp = UInt32[0x00000001, 0x00000003, 0x00000009, 0x0000166f, 0x000024a9, 0x000014a1, 0x000014f9, 0x00002ccd, 0x000000ab, 0x00000679, 0x000012b9, 0x00000c13, 0x00000c0d, 0x000007a4, 0x00000082, 0x00000d4a, 0x0000064f, 0x000029d5, 0x00003180, 0x000021e8]
└ @ Main In[9]:13
┌ Info: ----- SP (Djikstra):
│ convert(Array{Int64, 1}, paths[1]) = [1, 3, 9, 5743, 9385, 8405, 1499, 171, 1657, 4793, 3091, 11219, 12687, 10152, 10158, 10163, 195, 1671, 64]
└ @ Main In[11]:36
┌ Info: ----- SP (DF):
│ convert(Array{Int64, 1}, sp) = [1, 3, 9, 5743, 9385, 5281, 5369, 11469, 171, 1657, 4793, 3091, 3085, 1956, 130, 3402, 1615, 10709, 12672, 8680]
└ @ Main In[11]:46
┌ Info: computing personalized Pagerank for target node source t:
│ t = 65
└ @ Main In[11]:18
0.196102 seconds (2.13 k allocations: 280.436 MiB, 4.69% gc time)
┌ Info: computing DF
└ @ Main In[11]:23
┌ Info: searching shortest path (greedy approach) between vertices 1 and 65
└ @ Main In[9]:2
┌ Info: --- exploration reached a dead end
└ @ Main In[9]:12
┌ Info: --- explored path:
│ sp = UInt32[0x00000001, 0x00000003, 0x00000009, 0x0000166f, 0x000024a9, 0x000014a1, 0x000014f9, 0x00002ccd, 0x000000ab, 0x00000679, 0x000012b9, 0x00000c13, 0x00000c0d, 0x000007a4, 0x00000082, 0x00000d4a, 0x0000064f, 0x000029d5, 0x00003180, 0x000021e8]
└ @ Main In[9]:13
┌ Info: ----- SP (Djikstra):
│ convert(Array{Int64, 1}, paths[1]) = [1, 3, 9, 5743, 9385, 8405, 1499, 171, 1657, 4793, 3091, 11219, 12687, 10152, 10158, 10163, 195, 20, 65]
└ @ Main In[11]:36
┌ Info: ----- SP (DF):
│ convert(Array{Int64, 1}, sp) = [1, 3, 9, 5743, 9385, 5281, 5369, 11469, 171, 1657, 4793, 3091, 3085, 1956, 130, 3402, 1615, 10709, 12672, 8680]
└ @ Main In[11]:46
┌ Info: computing personalized Pagerank for target node source t:
│ t = 66
└ @ Main In[11]:18
0.191481 seconds (2.10 k allocations: 276.746 MiB, 4.32% gc time)
┌ Info: computing DF
└ @ Main In[11]:23
┌ Info: searching shortest path (greedy approach) between vertices 1 and 66
└ @ Main In[9]:2
┌ Info: --- exploration reached a dead end
└ @ Main In[9]:12
┌ Info: --- explored path:
│ sp = UInt32[0x00000001, 0x00000003, 0x00000009, 0x0000166f, 0x000024a9, 0x000014a1, 0x000014f9, 0x00002ccd, 0x000000ab, 0x00000679, 0x000012b9, 0x00000c13, 0x00000c0d, 0x000007a4, 0x00000082, 0x00000d4a, 0x0000064f, 0x000029d5, 0x00003180, 0x000021e8]
└ @ Main In[9]:13
┌ Info: ----- SP (Djikstra):
│ convert(Array{Int64, 1}, paths[1]) = [1, 3, 9, 5743, 9385, 8405, 1499, 171, 1657, 4793, 3091, 11219, 12687, 10152, 10158, 10163, 195, 20, 66]
└ @ Main In[11]:36
┌ Info: ----- SP (DF):
│ convert(Array{Int64, 1}, sp) = [1, 3, 9, 5743, 9385, 5281, 5369, 11469, 171, 1657, 4793, 3091, 3085, 1956, 130, 3402, 1615, 10709, 12672, 8680]
└ @ Main In[11]:46
┌ Info: computing personalized Pagerank for target node source t:
│ t = 67
└ @ Main In[11]:18
0.188170 seconds (2.10 k allocations: 276.746 MiB, 4.87% gc time)
┌ Info: computing DF
└ @ Main In[11]:23
┌ Info: searching shortest path (greedy approach) between vertices 1 and 67
└ @ Main In[9]:2
┌ Info: --- exploration reached a dead end
└ @ Main In[9]:12
┌ Info: --- explored path:
│ sp = UInt32[0x00000001, 0x00000003, 0x00000009, 0x0000166f, 0x000024a9, 0x000014a1, 0x000014f9, 0x00002ccd, 0x000000ab, 0x00000679, 0x000012b9, 0x00000c13, 0x00000c0d, 0x000007a4, 0x00000082, 0x00000d4a, 0x0000064f, 0x000029d5, 0x00003180, 0x000021e8]
└ @ Main In[9]:13
┌ Info: ----- SP (Djikstra):
│ convert(Array{Int64, 1}, paths[1]) = [1, 3, 9, 5743, 9385, 8405, 1499, 171, 1657, 4793, 3091, 11219, 12687, 10152, 10158, 10163, 195, 20, 67]
└ @ Main In[11]:36
┌ Info: ----- SP (DF):
│ convert(Array{Int64, 1}, sp) = [1, 3, 9, 5743, 9385, 5281, 5369, 11469, 171, 1657, 4793, 3091, 3085, 1956, 130, 3402, 1615, 10709, 12672, 8680]
└ @ Main In[11]:46
┌ Info: computing personalized Pagerank for target node source t:
│ t = 68
└ @ Main In[11]:18
0.190160 seconds (2.13 k allocations: 280.436 MiB, 4.71% gc time)
┌ Info: computing DF
└ @ Main In[11]:23
┌ Info: searching shortest path (greedy approach) between vertices 1 and 68
└ @ Main In[9]:2
┌ Info: --- exploration reached a dead end
└ @ Main In[9]:12
┌ Info: --- explored path:
│ sp = UInt32[0x00000001, 0x00000003, 0x00000009, 0x0000166f, 0x000024a9, 0x000014a1, 0x000014f9, 0x00002ccd, 0x000000ab, 0x00000679, 0x000012b9, 0x00000c13, 0x00000c0d, 0x000007a4, 0x00000082, 0x00000d4a, 0x0000064f, 0x000029d5, 0x00003180, 0x000021e8]
└ @ Main In[9]:13
┌ Info: ----- SP (Djikstra):
│ convert(Array{Int64, 1}, paths[1]) = [1, 3, 9, 5743, 9385, 8405, 1499, 171, 1657, 4793, 3091, 11219, 12687, 10152, 10158, 10163, 195, 20, 68]
└ @ Main In[11]:36
┌ Info: ----- SP (DF):
│ convert(Array{Int64, 1}, sp) = [1, 3, 9, 5743, 9385, 5281, 5369, 11469, 171, 1657, 4793, 3091, 3085, 1956, 130, 3402, 1615, 10709, 12672, 8680]
└ @ Main In[11]:46
┌ Info: computing personalized Pagerank for target node source t:
│ t = 69
└ @ Main In[11]:18
0.188542 seconds (2.07 k allocations: 273.056 MiB, 4.27% gc time)
┌ Info: computing DF
└ @ Main In[11]:23
┌ Info: searching shortest path (greedy approach) between vertices 1 and 69
└ @ Main In[9]:2
┌ Info: --- exploration reached a dead end
└ @ Main In[9]:12
┌ Info: --- explored path:
│ sp = UInt32[0x00000001, 0x00000003, 0x00000009, 0x0000166f, 0x000024a9, 0x000014a1, 0x000014f9, 0x00002ccd, 0x000000ab, 0x00000679, 0x000012b9, 0x00000c13, 0x00000c0d, 0x000007a4, 0x00000082, 0x00000d4a, 0x0000064f, 0x000029d5, 0x00003180, 0x000021e8]
└ @ Main In[9]:13
┌ Info: ----- SP (Djikstra):
│ convert(Array{Int64, 1}, paths[1]) = [1, 3, 9, 5743, 9385, 8405, 1499, 171, 1657, 4793, 3091, 11219, 12687, 10152, 10158, 10163, 195, 20, 69]
└ @ Main In[11]:36
┌ Info: ----- SP (DF):
│ convert(Array{Int64, 1}, sp) = [1, 3, 9, 5743, 9385, 5281, 5369, 11469, 171, 1657, 4793, 3091, 3085, 1956, 130, 3402, 1615, 10709, 12672, 8680]
└ @ Main In[11]:46
┌ Info: computing personalized Pagerank for target node source t:
│ t = 70
└ @ Main In[11]:18
0.178321 seconds (1.99 k allocations: 261.986 MiB, 4.75% gc time)
┌ Info: computing DF
└ @ Main In[11]:23
┌ Info: searching shortest path (greedy approach) between vertices 1 and 70
└ @ Main In[9]:2
┌ Info: path found:
│ sp = UInt32[0x00000001, 0x00000004, 0x00000007, 0x000000d7, 0x0000054f, 0x00000046]
└ @ Main In[9]:21
┌ Info: ----- SP (Djikstra):
│ convert(Array{Int64, 1}, paths[1]) = [1, 4, 7, 215, 1359, 70]
└ @ Main In[11]:36
┌ Info: ----- SP (DF):
│ convert(Array{Int64, 1}, sp) = [1, 4, 7, 215, 1359, 70]
└ @ Main In[11]:46
┌ Info: computing personalized Pagerank for target node source t:
│ t = 71
└ @ Main In[11]:18
0.192327 seconds (2.07 k allocations: 273.056 MiB, 4.26% gc time)
┌ Info: computing DF
└ @ Main In[11]:23
┌ Info: searching shortest path (greedy approach) between vertices 1 and 71
└ @ Main In[9]:2
┌ Info: path found:
│ sp = UInt32[0x00000001, 0x00000004, 0x00000007, 0x000000d7, 0x0000054f, 0x00000083, 0x00001914, 0x00000047]
└ @ Main In[9]:21
┌ Info: ----- SP (Djikstra):
│ convert(Array{Int64, 1}, paths[1]) = [1, 4, 7, 215, 1359, 131, 6420, 71]
└ @ Main In[11]:36
┌ Info: ----- SP (DF):
│ convert(Array{Int64, 1}, sp) = [1, 4, 7, 215, 1359, 131, 6420, 71]
└ @ Main In[11]:46
┌ Info: computing personalized Pagerank for target node source t:
│ t = 72
└ @ Main In[11]:18
0.171355 seconds (1.93 k allocations: 254.606 MiB, 4.66% gc time)
┌ Info: computing DF
└ @ Main In[11]:23
┌ Info: searching shortest path (greedy approach) between vertices 1 and 72
└ @ Main In[9]:2
┌ Info: path found:
│ sp = UInt32[0x00000001, 0x00000004, 0x00000007, 0x000000d7, 0x0000054f, 0x00000048]
└ @ Main In[9]:21
┌ Info: ----- SP (Djikstra):
│ convert(Array{Int64, 1}, paths[1]) = [1, 4, 7, 215, 1359, 72]
└ @ Main In[11]:36
┌ Info: ----- SP (DF):
│ convert(Array{Int64, 1}, sp) = [1, 4, 7, 215, 1359, 72]
└ @ Main In[11]:46
┌ Info: computing personalized Pagerank for target node source t:
│ t = 73
└ @ Main In[11]:18
0.179768 seconds (2.02 k allocations: 265.676 MiB, 4.57% gc time)
┌ Info: computing DF
└ @ Main In[11]:23
┌ Info: searching shortest path (greedy approach) between vertices 1 and 73
└ @ Main In[9]:2
┌ Info: path found:
│ sp = UInt32[0x00000001, 0x00000004, 0x00000007, 0x000000d7, 0x0000054f, 0x00000049]
└ @ Main In[9]:21
┌ Info: ----- SP (Djikstra):
│ convert(Array{Int64, 1}, paths[1]) = [1, 4, 7, 215, 1359, 73]
└ @ Main In[11]:36
┌ Info: ----- SP (DF):
│ convert(Array{Int64, 1}, sp) = [1, 4, 7, 215, 1359, 73]
└ @ Main In[11]:46
┌ Info: computing personalized Pagerank for target node source t:
│ t = 74
└ @ Main In[11]:18
0.179546 seconds (2.02 k allocations: 265.676 MiB, 4.65% gc time)
┌ Info: computing DF
└ @ Main In[11]:23
┌ Info: searching shortest path (greedy approach) between vertices 1 and 74
└ @ Main In[9]:2
┌ Info: path found:
│ sp = UInt32[0x00000001, 0x00000004, 0x00000007, 0x000000d7, 0x0000054f, 0x0000004a]
└ @ Main In[9]:21
┌ Info: ----- SP (Djikstra):
│ convert(Array{Int64, 1}, paths[1]) = [1, 4, 7, 215, 1359, 74]
└ @ Main In[11]:36
┌ Info: ----- SP (DF):
│ convert(Array{Int64, 1}, sp) = [1, 4, 7, 215, 1359, 74]
└ @ Main In[11]:46
┌ Info: computing personalized Pagerank for target node source t:
│ t = 75
└ @ Main In[11]:18
0.187394 seconds (2.02 k allocations: 265.676 MiB, 4.67% gc time)
┌ Info: computing DF
└ @ Main In[11]:23
┌ Info: searching shortest path (greedy approach) between vertices 1 and 75
└ @ Main In[9]:2
┌ Info: path found:
│ sp = UInt32[0x00000001, 0x00000004, 0x00000007, 0x000000d7, 0x0000054f, 0x0000004b]
└ @ Main In[9]:21
┌ Info: ----- SP (Djikstra):
│ convert(Array{Int64, 1}, paths[1]) = [1, 4, 7, 215, 1359, 75]
└ @ Main In[11]:36
┌ Info: ----- SP (DF):
│ convert(Array{Int64, 1}, sp) = [1, 4, 7, 215, 1359, 75]
└ @ Main In[11]:46
┌ Info: computing personalized Pagerank for target node source t:
│ t = 76
└ @ Main In[11]:18
0.178161 seconds (2.02 k allocations: 265.676 MiB, 4.63% gc time)
┌ Info: computing DF
└ @ Main In[11]:23
┌ Info: searching shortest path (greedy approach) between vertices 1 and 76
└ @ Main In[9]:2
┌ Info: path found:
│ sp = UInt32[0x00000001, 0x00000004, 0x00000007, 0x000000d7, 0x0000054f, 0x0000004c]
└ @ Main In[9]:21
┌ Info: ----- SP (Djikstra):
│ convert(Array{Int64, 1}, paths[1]) = [1, 4, 7, 215, 1359, 76]
└ @ Main In[11]:36
┌ Info: ----- SP (DF):
│ convert(Array{Int64, 1}, sp) = [1, 4, 7, 215, 1359, 76]
└ @ Main In[11]:46
┌ Info: computing personalized Pagerank for target node source t:
│ t = 77
└ @ Main In[11]:18
0.181012 seconds (2.02 k allocations: 265.676 MiB, 4.65% gc time)
┌ Info: computing DF
└ @ Main In[11]:23
┌ Info: searching shortest path (greedy approach) between vertices 1 and 77
└ @ Main In[9]:2
┌ Info: path found:
│ sp = UInt32[0x00000001, 0x00000004, 0x00000007, 0x000000d7, 0x0000054f, 0x0000004d]
└ @ Main In[9]:21
┌ Info: ----- SP (Djikstra):
│ convert(Array{Int64, 1}, paths[1]) = [1, 4, 7, 215, 1359, 77]
└ @ Main In[11]:36
┌ Info: ----- SP (DF):
│ convert(Array{Int64, 1}, sp) = [1, 4, 7, 215, 1359, 77]
└ @ Main In[11]:46
┌ Info: computing personalized Pagerank for target node source t:
│ t = 78
└ @ Main In[11]:18
0.173411 seconds (1.96 k allocations: 258.296 MiB, 4.37% gc time)
┌ Info: computing DF
└ @ Main In[11]:23
┌ Info: searching shortest path (greedy approach) between vertices 1 and 78
└ @ Main In[9]:2
┌ Info: path found:
│ sp = UInt32[0x00000001, 0x00000003, 0x00000009, 0x0000166f, 0x00002e06, 0x00000941, 0x000009c1, 0x00002c24, 0x000012bf, 0x0000004e]
└ @ Main In[9]:21
┌ Info: ----- SP (Djikstra):
│ convert(Array{Int64, 1}, paths[1]) = [1, 3, 9, 5743, 9385, 5281, 5369, 213, 78]
└ @ Main In[11]:36
┌ Info: ----- SP (DF):
│ convert(Array{Int64, 1}, sp) = [1, 3, 9, 5743, 11782, 2369, 2497, 11300, 4799, 78]
└ @ Main In[11]:46
┌ Info: computing personalized Pagerank for target node source t:
│ t = 79
└ @ Main In[11]:18
0.183782 seconds (2.05 k allocations: 269.366 MiB, 4.56% gc time)
┌ Info: computing DF
└ @ Main In[11]:23
┌ Info: searching shortest path (greedy approach) between vertices 1 and 79
└ @ Main In[9]:2
┌ Info: path found:
│ sp = UInt32[0x00000001, 0x00000003, 0x00000009, 0x0000166f, 0x000024a9, 0x000024bb, 0x00002f2f, 0x000012e3, 0x0000004f]
└ @ Main In[9]:21
┌ Info: ----- SP (Djikstra):
│ convert(Array{Int64, 1}, paths[1]) = [1, 4, 7, 215, 1359, 79]
└ @ Main In[11]:36
┌ Info: ----- SP (DF):
│ convert(Array{Int64, 1}, sp) = [1, 3, 9, 5743, 9385, 9403, 12079, 4835, 79]
└ @ Main In[11]:46
┌ Info: computing personalized Pagerank for target node source t:
│ t = 80
└ @ Main In[11]:18
0.186445 seconds (2.05 k allocations: 269.366 MiB, 4.83% gc time)
┌ Info: computing DF
└ @ Main In[11]:23
┌ Info: searching shortest path (greedy approach) between vertices 1 and 80
└ @ Main In[9]:2
┌ Info: path found:
│ sp = UInt32[0x00000001, 0x00000003, 0x00000009, 0x0000166f, 0x000024a9, 0x000024bb, 0x00002f2f, 0x000006bf, 0x00000050]
└ @ Main In[9]:21
┌ Info: ----- SP (Djikstra):
│ convert(Array{Int64, 1}, paths[1]) = [1, 4, 7, 215, 1359, 82, 80]
└ @ Main In[11]:36
┌ Info: ----- SP (DF):
│ convert(Array{Int64, 1}, sp) = [1, 3, 9, 5743, 9385, 9403, 12079, 1727, 80]
└ @ Main In[11]:46
┌ Info: computing personalized Pagerank for target node source t:
│ t = 81
└ @ Main In[11]:18
0.184479 seconds (1.99 k allocations: 261.986 MiB, 4.26% gc time)
┌ Info: computing DF
└ @ Main In[11]:23
┌ Info: searching shortest path (greedy approach) between vertices 1 and 81
└ @ Main In[9]:2
┌ Info: path found:
│ sp = UInt32[0x00000001, 0x00000004, 0x00000007, 0x000000d7, 0x0000054f, 0x00000051]
└ @ Main In[9]:21
┌ Info: ----- SP (Djikstra):
│ convert(Array{Int64, 1}, paths[1]) = [1, 4, 7, 215, 1359, 81]
└ @ Main In[11]:36
┌ Info: ----- SP (DF):
│ convert(Array{Int64, 1}, sp) = [1, 4, 7, 215, 1359, 81]
└ @ Main In[11]:46
┌ Info: computing personalized Pagerank for target node source t:
│ t = 82
└ @ Main In[11]:18
0.183507 seconds (2.05 k allocations: 269.366 MiB, 4.91% gc time)
┌ Info: computing DF
└ @ Main In[11]:23
┌ Info: searching shortest path (greedy approach) between vertices 1 and 82
└ @ Main In[9]:2
┌ Info: path found:
│ sp = UInt32[0x00000001, 0x00000004, 0x00000007, 0x000000d7, 0x0000054f, 0x00000052]
└ @ Main In[9]:21
┌ Info: ----- SP (Djikstra):
│ convert(Array{Int64, 1}, paths[1]) = [1, 4, 7, 215, 1359, 82]
└ @ Main In[11]:36
┌ Info: ----- SP (DF):
│ convert(Array{Int64, 1}, sp) = [1, 4, 7, 215, 1359, 82]
└ @ Main In[11]:46
┌ Info: computing personalized Pagerank for target node source t:
│ t = 83
└ @ Main In[11]:18
0.184116 seconds (2.05 k allocations: 269.366 MiB, 4.61% gc time)
┌ Info: computing DF
└ @ Main In[11]:23
┌ Info: searching shortest path (greedy approach) between vertices 1 and 83
└ @ Main In[9]:2
┌ Info: path found:
│ sp = UInt32[0x00000001, 0x00000003, 0x00000009, 0x0000166f, 0x000024a9, 0x000014a1, 0x000014f9, 0x000000d5, 0x000005b5, 0x000013c6, 0x00000053]
└ @ Main In[9]:21
┌ Info: ----- SP (Djikstra):
│ convert(Array{Int64, 1}, paths[1]) = [1, 3, 9, 5743, 9385, 5281, 5369, 213, 1622, 83]
└ @ Main In[11]:36
┌ Info: ----- SP (DF):
│ convert(Array{Int64, 1}, sp) = [1, 3, 9, 5743, 9385, 5281, 5369, 213, 1461, 5062, 83]
└ @ Main In[11]:46
┌ Info: computing personalized Pagerank for target node source t:
│ t = 84
└ @ Main In[11]:18
0.175656 seconds (1.96 k allocations: 258.296 MiB, 4.43% gc time)
┌ Info: computing DF
└ @ Main In[11]:23
┌ Info: searching shortest path (greedy approach) between vertices 1 and 84
└ @ Main In[9]:2
┌ Info: path found:
│ sp = UInt32[0x00000001, 0x00000003, 0x00000009, 0x0000166f, 0x000024a9, 0x000014a1, 0x000014f9, 0x000012cd, 0x000012be, 0x00000054]
└ @ Main In[9]:21
┌ Info: ----- SP (Djikstra):
│ convert(Array{Int64, 1}, paths[1]) = [1, 3, 9, 5743, 9385, 5281, 5369, 4813, 5816, 84]
└ @ Main In[11]:36
┌ Info: ----- SP (DF):
│ convert(Array{Int64, 1}, sp) = [1, 3, 9, 5743, 9385, 5281, 5369, 4813, 4798, 84]
└ @ Main In[11]:46
┌ Info: computing personalized Pagerank for target node source t:
│ t = 85
└ @ Main In[11]:18
0.180146 seconds (1.99 k allocations: 261.986 MiB, 4.65% gc time)
┌ Info: computing DF
└ @ Main In[11]:23
┌ Info: searching shortest path (greedy approach) between vertices 1 and 85
└ @ Main In[9]:2
┌ Info: path found:
│ sp = UInt32[0x00000001, 0x00000003, 0x00000009, 0x0000166f, 0x000024a9, 0x000014a1, 0x000014f9, 0x000012cd, 0x00000055]
└ @ Main In[9]:21
┌ Info: ----- SP (Djikstra):
│ convert(Array{Int64, 1}, paths[1]) = [1, 3, 9, 5743, 9385, 5281, 5369, 4813, 85]
└ @ Main In[11]:36
┌ Info: ----- SP (DF):
│ convert(Array{Int64, 1}, sp) = [1, 3, 9, 5743, 9385, 5281, 5369, 4813, 85]
└ @ Main In[11]:46
┌ Info: computing personalized Pagerank for target node source t:
│ t = 86
└ @ Main In[11]:18
0.183146 seconds (1.99 k allocations: 261.986 MiB, 4.66% gc time)
┌ Info: computing DF
└ @ Main In[11]:23
┌ Info: searching shortest path (greedy approach) between vertices 1 and 86
└ @ Main In[9]:2
┌ Info: path found:
│ sp = UInt32[0x00000001, 0x00000003, 0x00000009, 0x0000166f, 0x000024a9, 0x000014a1, 0x000014f9, 0x000012cd, 0x00000056]
└ @ Main In[9]:21
┌ Info: ----- SP (Djikstra):
│ convert(Array{Int64, 1}, paths[1]) = [1, 3, 9, 5743, 9385, 5281, 5369, 4813, 86]
└ @ Main In[11]:36
┌ Info: ----- SP (DF):
│ convert(Array{Int64, 1}, sp) = [1, 3, 9, 5743, 9385, 5281, 5369, 4813, 86]
└ @ Main In[11]:46
┌ Info: computing personalized Pagerank for target node source t:
│ t = 87
└ @ Main In[11]:18
0.188280 seconds (1.99 k allocations: 261.986 MiB, 4.64% gc time)
┌ Info: computing DF
└ @ Main In[11]:23
┌ Info: searching shortest path (greedy approach) between vertices 1 and 87
└ @ Main In[9]:2
┌ Info: path found:
│ sp = UInt32[0x00000001, 0x00000003, 0x00000009, 0x0000166f, 0x000024a9, 0x000014a1, 0x000014f9, 0x000012cd, 0x00000058, 0x00000057]
└ @ Main In[9]:21
┌ Info: ----- SP (Djikstra):
│ convert(Array{Int64, 1}, paths[1]) = [1, 3, 9, 5743, 9385, 5281, 5369, 4813, 88, 87]
└ @ Main In[11]:36
┌ Info: ----- SP (DF):
│ convert(Array{Int64, 1}, sp) = [1, 3, 9, 5743, 9385, 5281, 5369, 4813, 88, 87]
└ @ Main In[11]:46
┌ Info: computing personalized Pagerank for target node source t:
│ t = 88
└ @ Main In[11]:18
0.182440 seconds (1.99 k allocations: 261.986 MiB, 4.70% gc time)
┌ Info: computing DF
└ @ Main In[11]:23
┌ Info: searching shortest path (greedy approach) between vertices 1 and 88
└ @ Main In[9]:2
┌ Info: path found:
│ sp = UInt32[0x00000001, 0x00000003, 0x00000009, 0x0000166f, 0x000024a9, 0x000014a1, 0x000014f9, 0x000012cd, 0x00000058]
└ @ Main In[9]:21
┌ Info: ----- SP (Djikstra):
│ convert(Array{Int64, 1}, paths[1]) = [1, 3, 9, 5743, 9385, 5281, 5369, 4813, 88]
└ @ Main In[11]:36
┌ Info: ----- SP (DF):
│ convert(Array{Int64, 1}, sp) = [1, 3, 9, 5743, 9385, 5281, 5369, 4813, 88]
└ @ Main In[11]:46
┌ Info: computing personalized Pagerank for target node source t:
│ t = 89
└ @ Main In[11]:18
0.191919 seconds (2.10 k allocations: 276.746 MiB, 4.42% gc time)
┌ Info: computing DF
└ @ Main In[11]:23
┌ Info: searching shortest path (greedy approach) between vertices 1 and 89
└ @ Main In[9]:2
┌ Info: --- exploration reached a dead end
└ @ Main In[9]:12
┌ Info: --- explored path:
│ sp = UInt32[0x00000001, 0x00000003, 0x00000009, 0x0000166f, 0x000024a9, 0x000014a1, 0x000014f9, 0x00002ccd, 0x000000ab, 0x00000679, 0x000012b9, 0x00000c13, 0x00000c0d, 0x000007a4, 0x00000082, 0x00000d4a, 0x0000064f, 0x000029d5, 0x00003180, 0x000021e8]
└ @ Main In[9]:13
┌ Info: ----- SP (Djikstra):
│ convert(Array{Int64, 1}, paths[1]) = [1, 3, 9, 5743, 9385, 8405, 1499, 171, 1657, 4793, 3091, 11219, 9040, 190, 46, 39, 1798, 89]
└ @ Main In[11]:36
┌ Info: ----- SP (DF):
│ convert(Array{Int64, 1}, sp) = [1, 3, 9, 5743, 9385, 5281, 5369, 11469, 171, 1657, 4793, 3091, 3085, 1956, 130, 3402, 1615, 10709, 12672, 8680]
└ @ Main In[11]:46
┌ Info: computing personalized Pagerank for target node source t:
│ t = 90
└ @ Main In[11]:18
0.178697 seconds (2.02 k allocations: 265.676 MiB, 4.59% gc time)
┌ Info: computing DF
└ @ Main In[11]:23
┌ Info: searching shortest path (greedy approach) between vertices 1 and 90
└ @ Main In[9]:2
┌ Info: path found:
│ sp = UInt32[0x00000001, 0x00000003, 0x00000009, 0x0000166f, 0x000024a9, 0x000014a1, 0x000014f9, 0x000000d5, 0x0000005a]
└ @ Main In[9]:21
┌ Info: ----- SP (Djikstra):
│ convert(Array{Int64, 1}, paths[1]) = [1, 3, 9, 5743, 9385, 5281, 5369, 213, 90]
└ @ Main In[11]:36
┌ Info: ----- SP (DF):
│ convert(Array{Int64, 1}, sp) = [1, 3, 9, 5743, 9385, 5281, 5369, 213, 90]
└ @ Main In[11]:46
┌ Info: computing personalized Pagerank for target node source t:
│ t = 91
└ @ Main In[11]:18
0.204380 seconds (1.96 k allocations: 258.296 MiB, 4.48% gc time)
┌ Info: computing DF
└ @ Main In[11]:23
┌ Info: searching shortest path (greedy approach) between vertices 1 and 91
└ @ Main In[9]:2
┌ Info: path found:
│ sp = UInt32[0x00000001, 0x00000003, 0x00000009, 0x0000166f, 0x000024a9, 0x000014a1, 0x000014f9, 0x000012cd, 0x0000005b]
└ @ Main In[9]:21
┌ Info: ----- SP (Djikstra):
│ convert(Array{Int64, 1}, paths[1]) = [1, 3, 9, 5743, 9385, 5281, 5369, 4813, 91]
└ @ Main In[11]:36
┌ Info: ----- SP (DF):
│ convert(Array{Int64, 1}, sp) = [1, 3, 9, 5743, 9385, 5281, 5369, 4813, 91]
└ @ Main In[11]:46
┌ Info: computing personalized Pagerank for target node source t:
│ t = 92
└ @ Main In[11]:18
0.208786 seconds (1.96 k allocations: 258.296 MiB, 4.46% gc time)
┌ Info: computing DF
└ @ Main In[11]:23
┌ Info: searching shortest path (greedy approach) between vertices 1 and 92
└ @ Main In[9]:2
┌ Info: path found:
│ sp = UInt32[0x00000001, 0x00000003, 0x00000009, 0x0000166f, 0x000024a9, 0x000014a1, 0x000014f9, 0x000012cd, 0x0000005c]
└ @ Main In[9]:21
┌ Info: ----- SP (Djikstra):
│ convert(Array{Int64, 1}, paths[1]) = [1, 3, 9, 5743, 9385, 8405, 1499, 171, 92]
└ @ Main In[11]:36
┌ Info: ----- SP (DF):
│ convert(Array{Int64, 1}, sp) = [1, 3, 9, 5743, 9385, 5281, 5369, 4813, 92]
└ @ Main In[11]:46
┌ Info: computing personalized Pagerank for target node source t:
│ t = 93
└ @ Main In[11]:18
0.201387 seconds (2.05 k allocations: 269.366 MiB, 4.61% gc time)
┌ Info: computing DF
└ @ Main In[11]:23
┌ Info: searching shortest path (greedy approach) between vertices 1 and 93
└ @ Main In[9]:2
┌ Info: path found:
│ sp = UInt32[0x00000001, 0x00000003, 0x00000009, 0x0000166f, 0x000024a9, 0x000014a1, 0x000014f9, 0x000012cd, 0x0000005d]
└ @ Main In[9]:21
┌ Info: ----- SP (Djikstra):
│ convert(Array{Int64, 1}, paths[1]) = [1, 3, 9, 5743, 9385, 5281, 5369, 4813, 93]
└ @ Main In[11]:36
┌ Info: ----- SP (DF):
│ convert(Array{Int64, 1}, sp) = [1, 3, 9, 5743, 9385, 5281, 5369, 4813, 93]
└ @ Main In[11]:46
┌ Info: computing personalized Pagerank for target node source t:
│ t = 94
└ @ Main In[11]:18
0.185031 seconds (2.05 k allocations: 269.366 MiB, 4.58% gc time)
┌ Info: computing DF
└ @ Main In[11]:23
┌ Info: searching shortest path (greedy approach) between vertices 1 and 94
└ @ Main In[9]:2
┌ Info: --- exploration reached a dead end
└ @ Main In[9]:12
┌ Info: --- explored path:
│ sp = UInt32[0x00000001, 0x00000003, 0x00000009, 0x0000166f, 0x000024a9, 0x000014a1, 0x000014f9, 0x00002ccd, 0x000000ab, 0x00000679, 0x000012b9, 0x00000c13, 0x00000c0d, 0x000007a4, 0x00000082, 0x00000d4a, 0x0000064f, 0x000029d5, 0x00003180, 0x000021e8]
└ @ Main In[9]:13
┌ Info: ----- SP (Djikstra):
│ convert(Array{Int64, 1}, paths[1]) = [1, 3, 9, 5743, 9385, 8405, 1499, 171, 1657, 4793, 3091, 11219, 9040, 190, 46, 94]
└ @ Main In[11]:36
┌ Info: ----- SP (DF):
│ convert(Array{Int64, 1}, sp) = [1, 3, 9, 5743, 9385, 5281, 5369, 11469, 171, 1657, 4793, 3091, 3085, 1956, 130, 3402, 1615, 10709, 12672, 8680]
└ @ Main In[11]:46
┌ Info: computing personalized Pagerank for target node source t:
│ t = 95
└ @ Main In[11]:18
0.193205 seconds (2.05 k allocations: 269.366 MiB, 4.64% gc time)
┌ Info: computing DF
└ @ Main In[11]:23
┌ Info: searching shortest path (greedy approach) between vertices 1 and 95
└ @ Main In[9]:2
┌ Info: --- exploration reached a dead end
└ @ Main In[9]:12
┌ Info: --- explored path:
│ sp = UInt32[0x00000001, 0x00000003, 0x00000009, 0x0000166f, 0x000024a9, 0x000014a1, 0x000014f9, 0x00002ccd, 0x000000ab, 0x00000679, 0x000012b9, 0x00000c13, 0x00000c0d, 0x000007a4, 0x00000082, 0x00000d4a, 0x0000064f, 0x000029d5, 0x00003180, 0x000021e8]
└ @ Main In[9]:13
┌ Info: ----- SP (Djikstra):
│ convert(Array{Int64, 1}, paths[1]) = [1, 3, 9, 5743, 9385, 8405, 1499, 171, 1657, 4793, 3091, 11219, 12661, 1514, 18, 95]
└ @ Main In[11]:36
┌ Info: ----- SP (DF):
│ convert(Array{Int64, 1}, sp) = [1, 3, 9, 5743, 9385, 5281, 5369, 11469, 171, 1657, 4793, 3091, 3085, 1956, 130, 3402, 1615, 10709, 12672, 8680]
└ @ Main In[11]:46
┌ Info: computing personalized Pagerank for target node source t:
│ t = 96
└ @ Main In[11]:18
0.188907 seconds (1.99 k allocations: 261.986 MiB, 4.74% gc time)
┌ Info: computing DF
└ @ Main In[11]:23
┌ Info: searching shortest path (greedy approach) between vertices 1 and 96
└ @ Main In[9]:2
┌ Info: --- exploration reached a dead end
└ @ Main In[9]:12
┌ Info: --- explored path:
│ sp = UInt32[0x00000001, 0x00000003, 0x00000009, 0x0000166f, 0x000024a9, 0x000014a1, 0x000014f9, 0x00002ccd, 0x000000ab, 0x00000679, 0x000012b9, 0x00000c13, 0x00000c0d, 0x000007a4, 0x00000082, 0x00000d4a, 0x0000064f, 0x000029d5, 0x00003180, 0x000021e8]
└ @ Main In[9]:13
┌ Info: ----- SP (Djikstra):
│ convert(Array{Int64, 1}, paths[1]) = [1, 3, 9, 5743, 9385, 8405, 1499, 171, 1657, 4793, 3091, 11219, 9040, 190, 1476, 96]
└ @ Main In[11]:36
┌ Info: ----- SP (DF):
│ convert(Array{Int64, 1}, sp) = [1, 3, 9, 5743, 9385, 5281, 5369, 11469, 171, 1657, 4793, 3091, 3085, 1956, 130, 3402, 1615, 10709, 12672, 8680]
└ @ Main In[11]:46
┌ Info: computing personalized Pagerank for target node source t:
│ t = 97
└ @ Main In[11]:18
0.205776 seconds (2.07 k allocations: 273.056 MiB, 4.32% gc time)
┌ Info: computing DF
└ @ Main In[11]:23
┌ Info: searching shortest path (greedy approach) between vertices 1 and 97
└ @ Main In[9]:2
┌ Info: --- exploration reached a dead end
└ @ Main In[9]:12
┌ Info: --- explored path:
│ sp = UInt32[0x00000001, 0x00000003, 0x00000009, 0x0000166f, 0x000024a9, 0x000014a1, 0x000014f9, 0x00002ccd, 0x000000ab, 0x00000679, 0x000012b9, 0x00000c13, 0x00000c0d, 0x000007a4, 0x00000082, 0x00000d4a, 0x0000064f, 0x000029d5, 0x00003180, 0x000021e8]
└ @ Main In[9]:13
┌ Info: ----- SP (Djikstra):
│ convert(Array{Int64, 1}, paths[1]) = [1, 3, 9, 5743, 9385, 8405, 1499, 171, 1657, 4793, 3091, 11219, 9040, 190, 46, 39, 97]
└ @ Main In[11]:36
┌ Info: ----- SP (DF):
│ convert(Array{Int64, 1}, sp) = [1, 3, 9, 5743, 9385, 5281, 5369, 11469, 171, 1657, 4793, 3091, 3085, 1956, 130, 3402, 1615, 10709, 12672, 8680]
└ @ Main In[11]:46
┌ Info: computing personalized Pagerank for target node source t:
│ t = 98
└ @ Main In[11]:18
0.188485 seconds (2.07 k allocations: 273.056 MiB, 5.00% gc time)
┌ Info: computing DF
└ @ Main In[11]:23
┌ Info: searching shortest path (greedy approach) between vertices 1 and 98
└ @ Main In[9]:2
┌ Info: --- exploration reached a dead end
└ @ Main In[9]:12
┌ Info: --- explored path:
│ sp = UInt32[0x00000001, 0x00000003, 0x00000009, 0x0000166f, 0x000024a9, 0x000014a1, 0x000014f9, 0x00002ccd, 0x000000ab, 0x00000679, 0x000012b9, 0x00000c13, 0x00000c0d, 0x000007a4, 0x00000082, 0x00000d4a, 0x0000064f, 0x000029d5, 0x00003180, 0x000021e8]
└ @ Main In[9]:13
┌ Info: ----- SP (Djikstra):
│ convert(Array{Int64, 1}, paths[1]) = [1, 3, 9, 5743, 9385, 8405, 1499, 171, 1657, 4793, 3091, 11219, 12661, 1514, 18, 40, 98]
└ @ Main In[11]:36
┌ Info: ----- SP (DF):
│ convert(Array{Int64, 1}, sp) = [1, 3, 9, 5743, 9385, 5281, 5369, 11469, 171, 1657, 4793, 3091, 3085, 1956, 130, 3402, 1615, 10709, 12672, 8680]
└ @ Main In[11]:46
┌ Info: computing personalized Pagerank for target node source t:
│ t = 99
└ @ Main In[11]:18
0.167846 seconds (1.85 k allocations: 243.536 MiB, 4.60% gc time)
┌ Info: computing DF
└ @ Main In[11]:23
┌ Info: searching shortest path (greedy approach) between vertices 1 and 99
└ @ Main In[9]:2
┌ Info: path found:
│ sp = UInt32[0x00000001, 0x00000003, 0x00000009, 0x0000166f, 0x00002055, 0x00000941, 0x000009c1, 0x00002c24, 0x000012bf, 0x00000085, 0x00000712, 0x00000063]
└ @ Main In[9]:21
┌ Info: ----- SP (Djikstra):
│ convert(Array{Int64, 1}, paths[1]) = [1, 4, 7, 215, 1359, 429, 99]
└ @ Main In[11]:36
┌ Info: ----- SP (DF):
│ convert(Array{Int64, 1}, sp) = [1, 3, 9, 5743, 8277, 2369, 2497, 11300, 4799, 133, 1810, 99]
└ @ Main In[11]:46
┌ Info: computing personalized Pagerank for target node source t:
│ t = 100
└ @ Main In[11]:18
0.172762 seconds (1.93 k allocations: 254.606 MiB, 4.53% gc time)
┌ Info: computing DF
└ @ Main In[11]:23
┌ Info: searching shortest path (greedy approach) between vertices 1 and 100
└ @ Main In[9]:2
┌ Info: path found:
│ sp = UInt32[0x00000001, 0x00000004, 0x00000007, 0x000000d7, 0x0000054f, 0x00000064]
└ @ Main In[9]:21
┌ Info: ----- SP (Djikstra):
│ convert(Array{Int64, 1}, paths[1]) = [1, 4, 7, 215, 1359, 100]
└ @ Main In[11]:36
┌ Info: ----- SP (DF):
│ convert(Array{Int64, 1}, sp) = [1, 4, 7, 215, 1359, 100]
└ @ Main In[11]:46
┌ Info: % same SP:
│ sc / tc = 0.37373737373737376
└ @ Main In[11]:57
┌ Info: % same length:
│ sc2 / tc = 0.3939393939393939
└ @ Main In[11]:58
In [ ]:
Content source: jimbotonic/JCNL
Similar notebooks: