-
Notifications
You must be signed in to change notification settings - Fork 5
/
1.5.0-DEV-4085873ec6.log
145 lines (140 loc) · 5.87 KB
/
1.5.0-DEV-4085873ec6.log
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
Julia Version 1.5.0-DEV.431
Commit 4085873ec6 (2020-03-10 23:48 UTC)
Platform Info:
OS: Linux (x86_64-pc-linux-gnu)
CPU: Intel(R) Xeon(R) Silver 4114 CPU @ 2.20GHz
WORD_SIZE: 64
LIBM: libopenlibm
LLVM: libLLVM-9.0.1 (ORCJIT, skylake)
Environment:
JULIA_DEPOT_PATH = ::/usr/local/share/julia
JULIA_NUM_THREADS = 2
Resolving package versions...
Installed OrderedCollections ─ v1.1.0
Installed Graphs ───────────── v0.10.3
Installed DataStructures ───── v0.17.10
Updating `~/.julia/environments/v1.5/Project.toml`
86223c79 + Graphs v0.10.3
Updating `~/.julia/environments/v1.5/Manifest.toml`
864edb3b + DataStructures v0.17.10
86223c79 + Graphs v0.10.3
bac558e1 + OrderedCollections v1.1.0
2a0f44e3 + Base64
8ba89e20 + Distributed
b77e0a4c + InteractiveUtils
8f399da3 + Libdl
37e2e46d + LinearAlgebra
56ddb016 + Logging
d6f4376e + Markdown
9a3f8284 + Random
9e88b42a + Serialization
6462fe0b + Sockets
2f01184e + SparseArrays
8dfed614 + Test
Testing Graphs
Status `/tmp/jl_dOKJcz/Project.toml`
864edb3b DataStructures v0.17.10
86223c79 Graphs v0.10.3
2f01184e SparseArrays
8dfed614 Test
Status `/tmp/jl_dOKJcz/Manifest.toml`
864edb3b DataStructures v0.17.10
86223c79 Graphs v0.10.3
bac558e1 OrderedCollections v1.1.0
2a0f44e3 Base64
8ba89e20 Distributed
b77e0a4c InteractiveUtils
8f399da3 Libdl
37e2e46d LinearAlgebra
56ddb016 Logging
d6f4376e Markdown
9a3f8284 Random
9e88b42a Serialization
6462fe0b Sockets
2f01184e SparseArrays
8dfed614 Test
running /home/pkgeval/.julia/packages/Graphs/GQCid/test/edgelist.jl ...
running /home/pkgeval/.julia/packages/Graphs/GQCid/test/adjlist.jl ...
running /home/pkgeval/.julia/packages/Graphs/GQCid/test/bellman_test.jl ...
running /home/pkgeval/.julia/packages/Graphs/GQCid/test/inclist.jl ...
running /home/pkgeval/.julia/packages/Graphs/GQCid/test/graph.jl ...
Test Summary: | Pass Total
SimpleDirectedGraph | 58 58
Test Summary: | Pass Total
SimpleUndirectedGraph | 34 34
Test Summary: | Pass Total
Extended and General directed graph | 104 104
Test Summary: | Pass Total
graph() constructor | 2206 2206
running /home/pkgeval/.julia/packages/Graphs/GQCid/test/gmatrix.jl ...
running /home/pkgeval/.julia/packages/Graphs/GQCid/test/bfs.jl ...
running /home/pkgeval/.julia/packages/Graphs/GQCid/test/dfs.jl ...
running /home/pkgeval/.julia/packages/Graphs/GQCid/test/conn_comp.jl ...
running /home/pkgeval/.julia/packages/Graphs/GQCid/test/dijkstra.jl ...
┌ Warning: `mutable_binary_minheap(::Type{T}) where T` is deprecated, use `MutableBinaryMinHeap{T}()` instead.
│ caller = create_dijkstra_states(::GenericIncidenceList{Int64,Edge{Int64},UnitRange{Int64},Array{Array{Edge{Int64},1},1}}, ::Type{Float64}) at dijkstra_spath.jl:33
└ @ Graphs ~/.julia/packages/Graphs/GQCid/src/dijkstra_spath.jl:33
┌ Warning: `mutable_binary_minheap(::Type{T}) where T` is deprecated, use `MutableBinaryMinHeap{T}()` instead.
│ caller = create_dijkstra_states(::GenericGraph{Int64,ExEdge{Int64},Array{Int64,1},Array{ExEdge{Int64},1},Array{Array{ExEdge{Int64},1},1}}, ::Type{Float64}) at dijkstra_spath.jl:33
└ @ Graphs ~/.julia/packages/Graphs/GQCid/src/dijkstra_spath.jl:33
┌ Warning: `mutable_binary_minheap(::Type{T}) where T` is deprecated, use `MutableBinaryMinHeap{T}()` instead.
│ caller = create_dijkstra_states(::GenericGraph{Int64,Edge{Int64},UnitRange{Int64},Array{Edge{Int64},1},Array{Array{Edge{Int64},1},1}}, ::Type{Float64}) at dijkstra_spath.jl:33
└ @ Graphs ~/.julia/packages/Graphs/GQCid/src/dijkstra_spath.jl:33
┌ Warning: `mutable_binary_minheap(::Type{T}) where T` is deprecated, use `MutableBinaryMinHeap{T}()` instead.
│ caller = create_dijkstra_states(::GenericIncidenceList{Int64,Edge{Int64},Array{Int64,1},Array{Array{Edge{Int64},1},1}}, ::Type{Float64}) at dijkstra_spath.jl:33
└ @ Graphs ~/.julia/packages/Graphs/GQCid/src/dijkstra_spath.jl:33
running /home/pkgeval/.julia/packages/Graphs/GQCid/test/a_star_spath.jl ...
running /home/pkgeval/.julia/packages/Graphs/GQCid/test/mst.jl ...
┌ Warning: `mutable_binary_minheap(::Type{T}) where T` is deprecated, use `MutableBinaryMinHeap{T}()` instead.
│ caller = create_prim_states(::GenericIncidenceList{Int64,Edge{Int64},UnitRange{Int64},Array{Array{Edge{Int64},1},1}}, ::Type{Float64}) at prim_mst.jl:35
└ @ Graphs ~/.julia/packages/Graphs/GQCid/src/prim_mst.jl:35
running /home/pkgeval/.julia/packages/Graphs/GQCid/test/floyd.jl ...
running /home/pkgeval/.julia/packages/Graphs/GQCid/test/dot.jl ...
running /home/pkgeval/.julia/packages/Graphs/GQCid/test/dot2.jl ...
implements_edge_list(sgd) == true = true
implements_vertex_map(sgd) == true = true
digraph graphname {
1
2
3
4
}
digraph graphname {
1
2
3
4
1 -> 3
3 -> 1
2 -> 3
}
implements_edge_list(ag) == true = true
implements_vertex_map(ag) == true = true
digraph graphname {
1 ["label"="a","color"="bisque"]
2 ["label"="b","color"="bisque"]
3 ["label"="c","color"="bisque"]
4 ["label"="d","color"="bisque"]
1 -> 3
3 -> 1
2 -> 3
}
graph graphname {
1 ["label"="a","color"="bisque"]
2 ["label"="b","color"="bisque"]
3 ["label"="c","color"="bisque"]
4 ["label"="d","color"="bisque"]
1 -- 3
2 -- 3
}
implements_edge_list(agu) == true = true
implements_vertex_map(agu) == true = true
running /home/pkgeval/.julia/packages/Graphs/GQCid/test/cliques.jl ...
running /home/pkgeval/.julia/packages/Graphs/GQCid/test/random.jl ...
running /home/pkgeval/.julia/packages/Graphs/GQCid/test/generators.jl ...
running /home/pkgeval/.julia/packages/Graphs/GQCid/test/maximum_adjacency_visit.jl ...
running /home/pkgeval/.julia/packages/Graphs/GQCid/test/issue_related_tests.jl ...
running /home/pkgeval/.julia/packages/Graphs/GQCid/test/inclist_dict_delete.jl ...
Test Summary: | Pass Total
Incidence Dictionaries | 22 22
Testing Graphs tests passed