push test coverage

Author: GiggleLiu

src/arithematics.jl

@@ -357,25 +357,17 @@ end
 
 # AbstractTree APIs
 function children(t::TreeConfigEnumerator)
-    if isdefined(t, :left)
-        if isdefined(t, :right)
-            return [t.left, t.right]
-        else
-            return [t.left]
-        end
+    if t.tag == ZERO || t.tag == LEAF
+        return typeof(t)[]
     else
-        if isdefined(t, :right)
-            return [t.right]
-        else
-            return typeof(t)[]
-        end
+        return [t.left, t.right]
     end
 end
 function printnode(io::IO, t::TreeConfigEnumerator)
     if t.tag === LEAF
         print(io, t.data)
     elseif t.tag === ZERO
-        print(io, "")
+        print(io, "∅")
     elseif t.tag === SUM
         print(io, "+")
     else  # PROD
@@ -448,11 +440,11 @@ Base.zero(::TreeConfigEnumerator{N,S,C}) where {N,S,C} = zero(TreeConfigEnumerat
 Base.one(::TreeConfigEnumerator{N,S,C}) where {N,S,C} = one(TreeConfigEnumerator{N,S,C})
 # todo, check siblings too?
 function Base.iszero(t::TreeConfigEnumerator)
-    if t.TAG == SUM
+    if t.tag == SUM
         iszero(t.left) && iszero(t.right)
-    elseif t.TAG == ZERO
+    elseif t.tag == ZERO
         true
-    elseif t.TAG == LEAF
+    elseif t.tag == LEAF
         false
     else
         iszero(t.left) || iszero(t.right)
@@ -497,11 +489,11 @@ onehotv(::Type{ConfigSampler{N,S,C}}, i::Integer, v) where {N,S,C} = ConfigSampl
 Base.transpose(c::ConfigEnumerator) = c
 Base.copy(c::ConfigEnumerator) = ConfigEnumerator(copy(c.data))
 Base.transpose(c::TreeConfigEnumerator) = c
-function Base.copy(c::TreeConfigEnumerator)
+function Base.copy(c::TreeConfigEnumerator{N,S,C}) where {N,S,C}
     if c.tag == LEAF
         TreeConfigEnumerator(c.data)
     elseif c.tag == ZERO
-        TreeConfigEnumerator(c.tag)
+        TreeConfigEnumerator{N,S,C}(c.tag)
     else
         TreeConfigEnumerator(c.tag, c.left, c.right)
     end

src/interfaces.jl

@@ -271,7 +271,6 @@ end
 
 # raise an error if the property for problem can not be computed
 _solvable(::Any, ::Any) = true
-_solvable(::Coloring, ::GraphPolynomial) = false
 
 # negate the exponents before entering the solver
 pre_invert_exponent(t::TruncatedPoly{K}) where K = TruncatedPoly(t.coeffs, -t.maxorder)

test/arithematics.jl

@@ -75,6 +75,8 @@ end
     @test length(a + a) == 2
     @test length(a * a) == 1
     print((a+a) * a)
+    b = a + a
+    @test GraphTensorNetworks.num_nodes(b * b) == 3
 
     a = ConfigSampler(StaticBitVector(rand(Bool, 10)))
     @test 1 * a == a
@@ -95,4 +97,20 @@ end
     x = ConfigSampler(bv"00111")
     @test x ^ 0 == one(x)
     @test x ^ 2.0 == x
+end
+
+@testset "push coverage" begin
+    @test abs(Mod{5}(2)) == Mod{5}(2)
+    @test one(ConfigSampler(bv"11100")) == ConfigSampler(bv"00000")
+    @test one(TreeConfigEnumerator{5,1,1}(GraphTensorNetworks.ZERO)) == TreeConfigEnumerator(bv"00000")
+    @test iszero(copy(TreeConfigEnumerator{5,1,1}(GraphTensorNetworks.ZERO)))
+    x = TreeConfigEnumerator(bv"00111")
+    @test copy(x) == x
+    @test copy(x) !== x
+    @test !iszero(x)
+    y = x + x
+    @test copy(y) == y
+    @test copy(y) !== y
+    @test !iszero(y)
+    println((x * x) * zero(x))
 end

test/graphs.jl

@@ -8,4 +8,11 @@ using GraphTensorNetworks, Test, Graphs
     g = unit_disk_graph([(0.1, 0.2), (0.2, 0.3), (1.2, 1.4)], 1.0)
     @test ne(g) == 1
     @test nv(g) == 3
+end
+
+@testset "line graph" begin
+    g = smallgraph(:petersen)
+    lg = line_graph(g)
+    @test nv(lg) == 15
+    @test ne(lg) == 45
 end