tests

Author: CarloLucibello

test/gnngraph.jl

@@ -17,13 +17,16 @@
 
         @test g.num_edges == 8
         @test g.num_nodes == 4
+        @test nv(g) == g.num_nodes
+        @test ne(g) == g.num_edges
         @test collect(edges(g)) |> sort == collect(zip(s, t)) |> sort
         @test sort(outneighbors(g, 1)) == [2, 4] 
         @test sort(inneighbors(g, 1)) == [2, 4] 
         @test is_directed(g) == true
         s1, t1 = GraphNeuralNetworks.sort_edge_index(edge_index(g))
         @test s1 == s
         @test t1 == t
+        @test vertices(g) == 1:g.num_nodes
 
         @test sort.(adjacency_list(g; dir=:in)) == adj_list_in
         @test sort.(adjacency_list(g; dir=:out)) == adj_list_out
@@ -119,6 +122,7 @@
         @test sort(outneighbors(g, 1)) == [2] 
         @test sort(inneighbors(g, 1)) == [4] 
         @test is_directed(g) == true
+        @test is_directed(typeof(g)) == true
         s1, t1 = GraphNeuralNetworks.sort_edge_index(edge_index(g))
         @test s1 == s
         @test t1 == t

test/test_utils.jl

@@ -12,7 +12,7 @@ function FiniteDifferences.to_vec(x::Integer)
     return Int[x], Integer_from_vec
 end
 
-function test_layer(l, g::GNNGraph; atol = 1e-7, rtol = 1e-5,
+function test_layer(l, g::GNNGraph; atol = 1e-6, rtol = 1e-5,
                                  exclude_grad_fields = [],
                                  broken_grad_fields =[],
                                  verbose = false,