Graphs

← Back to package list

If you think that there is an error in how your package is being tested or represented, please file an issue at NewPkgEval.jl, making sure to read the FAQ first.

Results with Julia v1.2.0

Testing was successful. Last evaluation was ago and took 1 minute, 8 seconds.

Click here to download the log file. 

 Resolving package versions...
 Installed OrderedCollections ─ v1.1.0
 Installed Graphs ───────────── v0.10.3
 Installed DataStructures ───── v0.17.6
  Updating `~/.julia/environments/v1.2/Project.toml`
  [86223c79] + Graphs v0.10.3
  Updating `~/.julia/environments/v1.2/Manifest.toml`
  [864edb3b] + DataStructures v0.17.6
  [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
 Resolving package versions...
    Status `/tmp/jl_JHmVI1/Manifest.toml`
  [864edb3b] DataStructures v0.17.6
  [86223c79] Graphs v0.10.3
  [bac558e1] OrderedCollections v1.1.0
  [2a0f44e3] Base64  [`@stdlib/Base64`]
  [8ba89e20] Distributed  [`@stdlib/Distributed`]
  [b77e0a4c] InteractiveUtils  [`@stdlib/InteractiveUtils`]
  [8f399da3] Libdl  [`@stdlib/Libdl`]
  [37e2e46d] LinearAlgebra  [`@stdlib/LinearAlgebra`]
  [56ddb016] Logging  [`@stdlib/Logging`]
  [d6f4376e] Markdown  [`@stdlib/Markdown`]
  [9a3f8284] Random  [`@stdlib/Random`]
  [9e88b42a] Serialization  [`@stdlib/Serialization`]
  [6462fe0b] Sockets  [`@stdlib/Sockets`]
  [2f01184e] SparseArrays  [`@stdlib/SparseArrays`]
  [8dfed614] Test  [`@stdlib/Test`]
running /root/.julia/packages/Graphs/GQCid/test/edgelist.jl ...
running /root/.julia/packages/Graphs/GQCid/test/adjlist.jl ...
running /root/.julia/packages/Graphs/GQCid/test/bellman_test.jl ...
running /root/.julia/packages/Graphs/GQCid/test/inclist.jl ...
running /root/.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 /root/.julia/packages/Graphs/GQCid/test/gmatrix.jl ...
running /root/.julia/packages/Graphs/GQCid/test/bfs.jl ...
running /root/.julia/packages/Graphs/GQCid/test/dfs.jl ...
running /root/.julia/packages/Graphs/GQCid/test/conn_comp.jl ...
running /root/.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 /root/.julia/packages/Graphs/GQCid/test/a_star_spath.jl ...
running /root/.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 /root/.julia/packages/Graphs/GQCid/test/floyd.jl ...
running /root/.julia/packages/Graphs/GQCid/test/dot.jl ...
running /root/.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 /root/.julia/packages/Graphs/GQCid/test/cliques.jl ...
running /root/.julia/packages/Graphs/GQCid/test/random.jl ...
running /root/.julia/packages/Graphs/GQCid/test/generators.jl ...
running /root/.julia/packages/Graphs/GQCid/test/maximum_adjacency_visit.jl ...
running /root/.julia/packages/Graphs/GQCid/test/issue_related_tests.jl ...
running /root/.julia/packages/Graphs/GQCid/test/inclist_dict_delete.jl ...
Test Summary:          | Pass  Total
Incidence Dictionaries |   22     22
   Testing Graphs tests passed

Results with Julia v1.3.0

Testing was successful. Last evaluation was ago and took 1 minute, 5 seconds.

Click here to download the log file. 

 Resolving package versions...
 Installed OrderedCollections ─ v1.1.0
 Installed Graphs ───────────── v0.10.3
 Installed DataStructures ───── v0.17.6
  Updating `~/.julia/environments/v1.3/Project.toml`
  [86223c79] + Graphs v0.10.3
  Updating `~/.julia/environments/v1.3/Manifest.toml`
  [864edb3b] + DataStructures v0.17.6
  [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
 Resolving package versions...
    Status `/tmp/jl_Dp2zJt/Manifest.toml`
  [864edb3b] DataStructures v0.17.6
  [86223c79] Graphs v0.10.3
  [bac558e1] OrderedCollections v1.1.0
  [2a0f44e3] Base64  [`@stdlib/Base64`]
  [8ba89e20] Distributed  [`@stdlib/Distributed`]
  [b77e0a4c] InteractiveUtils  [`@stdlib/InteractiveUtils`]
  [8f399da3] Libdl  [`@stdlib/Libdl`]
  [37e2e46d] LinearAlgebra  [`@stdlib/LinearAlgebra`]
  [56ddb016] Logging  [`@stdlib/Logging`]
  [d6f4376e] Markdown  [`@stdlib/Markdown`]
  [9a3f8284] Random  [`@stdlib/Random`]
  [9e88b42a] Serialization  [`@stdlib/Serialization`]
  [6462fe0b] Sockets  [`@stdlib/Sockets`]
  [2f01184e] SparseArrays  [`@stdlib/SparseArrays`]
  [8dfed614] Test  [`@stdlib/Test`]
running /root/.julia/packages/Graphs/GQCid/test/edgelist.jl ...
running /root/.julia/packages/Graphs/GQCid/test/adjlist.jl ...
running /root/.julia/packages/Graphs/GQCid/test/bellman_test.jl ...
running /root/.julia/packages/Graphs/GQCid/test/inclist.jl ...
running /root/.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 /root/.julia/packages/Graphs/GQCid/test/gmatrix.jl ...
running /root/.julia/packages/Graphs/GQCid/test/bfs.jl ...
running /root/.julia/packages/Graphs/GQCid/test/dfs.jl ...
running /root/.julia/packages/Graphs/GQCid/test/conn_comp.jl ...
running /root/.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 /root/.julia/packages/Graphs/GQCid/test/a_star_spath.jl ...
running /root/.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 /root/.julia/packages/Graphs/GQCid/test/floyd.jl ...
running /root/.julia/packages/Graphs/GQCid/test/dot.jl ...
running /root/.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 /root/.julia/packages/Graphs/GQCid/test/cliques.jl ...
running /root/.julia/packages/Graphs/GQCid/test/random.jl ...
running /root/.julia/packages/Graphs/GQCid/test/generators.jl ...
running /root/.julia/packages/Graphs/GQCid/test/maximum_adjacency_visit.jl ...
running /root/.julia/packages/Graphs/GQCid/test/issue_related_tests.jl ...
running /root/.julia/packages/Graphs/GQCid/test/inclist_dict_delete.jl ...
Test Summary:          | Pass  Total
Incidence Dictionaries |   22     22
   Testing Graphs tests passed

Results with Julia v1.3.1-pre-7704df0a5a

Testing was successful. Last evaluation was ago and took 1 minute, 1 second.

Click here to download the log file. 

 Resolving package versions...
 Installed OrderedCollections ─ v1.1.0
 Installed Graphs ───────────── v0.10.3
 Installed DataStructures ───── v0.17.6
  Updating `~/.julia/environments/v1.3/Project.toml`
  [86223c79] + Graphs v0.10.3
  Updating `~/.julia/environments/v1.3/Manifest.toml`
  [864edb3b] + DataStructures v0.17.6
  [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
 Resolving package versions...
    Status `/tmp/jl_VxHNx7/Manifest.toml`
  [864edb3b] DataStructures v0.17.6
  [86223c79] Graphs v0.10.3
  [bac558e1] OrderedCollections v1.1.0
  [2a0f44e3] Base64  [`@stdlib/Base64`]
  [8ba89e20] Distributed  [`@stdlib/Distributed`]
  [b77e0a4c] InteractiveUtils  [`@stdlib/InteractiveUtils`]
  [8f399da3] Libdl  [`@stdlib/Libdl`]
  [37e2e46d] LinearAlgebra  [`@stdlib/LinearAlgebra`]
  [56ddb016] Logging  [`@stdlib/Logging`]
  [d6f4376e] Markdown  [`@stdlib/Markdown`]
  [9a3f8284] Random  [`@stdlib/Random`]
  [9e88b42a] Serialization  [`@stdlib/Serialization`]
  [6462fe0b] Sockets  [`@stdlib/Sockets`]
  [2f01184e] SparseArrays  [`@stdlib/SparseArrays`]
  [8dfed614] Test  [`@stdlib/Test`]
running /root/.julia/packages/Graphs/GQCid/test/edgelist.jl ...
running /root/.julia/packages/Graphs/GQCid/test/adjlist.jl ...
running /root/.julia/packages/Graphs/GQCid/test/bellman_test.jl ...
running /root/.julia/packages/Graphs/GQCid/test/inclist.jl ...
running /root/.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 /root/.julia/packages/Graphs/GQCid/test/gmatrix.jl ...
running /root/.julia/packages/Graphs/GQCid/test/bfs.jl ...
running /root/.julia/packages/Graphs/GQCid/test/dfs.jl ...
running /root/.julia/packages/Graphs/GQCid/test/conn_comp.jl ...
running /root/.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 /root/.julia/packages/Graphs/GQCid/test/a_star_spath.jl ...
running /root/.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 /root/.julia/packages/Graphs/GQCid/test/floyd.jl ...
running /root/.julia/packages/Graphs/GQCid/test/dot.jl ...
running /root/.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 /root/.julia/packages/Graphs/GQCid/test/cliques.jl ...
running /root/.julia/packages/Graphs/GQCid/test/random.jl ...
running /root/.julia/packages/Graphs/GQCid/test/generators.jl ...
running /root/.julia/packages/Graphs/GQCid/test/maximum_adjacency_visit.jl ...
running /root/.julia/packages/Graphs/GQCid/test/issue_related_tests.jl ...
running /root/.julia/packages/Graphs/GQCid/test/inclist_dict_delete.jl ...
Test Summary:          | Pass  Total
Incidence Dictionaries |   22     22
   Testing Graphs tests passed