fix graph polynomial (#38)

Author: GiggleLiu

Project.toml

@@ -1,7 +1,7 @@
 name = "GenericTensorNetworks"
 uuid = "3521c873-ad32-4bb4-b63d-f4f178f42b49"
 authors = ["GiggleLiu <cacate0129@gmail.com> and contributors"]
-version = "1.0.0"
+version = "1.0.1"
 
 [deps]
 AbstractTrees = "1520ce14-60c1-5f80-bbc7-55ef81b5835c"

docs/src/index.md

@@ -15,7 +15,7 @@ The solvable problems include [Independent set problem](@ref), [Maximal independ
 
 ## Background knowledge
 
-Please check our paper ["Computing properties of independent sets by generic programming tensor networks"]().
+Please check our paper ["Computing properties of independent sets by generic programming tensor networks"]()(paper to be released soon).
 If you find our paper or software useful in your work, we would be grateful if you could cite our work. The [CITATION.bib](https://github.com/QuEraComputing/GenericTensorNetworks.jl/blob/master/CITATION.bib) file in the root of this repository lists the relevant papers.
 
 ## Quick start

src/graph_polynomials.jl

@@ -57,7 +57,7 @@ function _polynomial_single(gp::GraphProblem, ::Type{T}; usecuda, maxorder) wher
 	xs = 0:maxorder
     ys = [Array(contractx(gp, T(x); usecuda=usecuda)) for x in xs]  # download to CPU
     res = fill(T[], size(ys[1]))  # contraction result can be a tensor
-    for ci in length(ys[1])
+    for ci in 1:length(ys[1])
 	    A = zeros(T, maxorder+1, maxorder+1)
         for j=1:maxorder+1, i=1:maxorder+1
             A[j,i] = T(xs[j])^(i-1)

test/graph_polynomials.jl

@@ -35,4 +35,14 @@ end
     p6 = graph_polynomial(gp, Val(:polynomial))[]
     p7 = graph_polynomial(gp, Val(:finitefield))[]
     @test p6 ≈ p7
+end
+
+@testset "open indices" begin
+    g = SimpleGraph(3)
+    for (i,j) in [(1,2), (2,3)]
+        add_edge!(g, i, j)
+    end
+    m1 = solve(IndependentSet(g; openvertices=(1,3)), GraphPolynomial())
+    m2 = solve(IndependentSet(g; openvertices=(1,3)), GraphPolynomial(;method=:polynomial))
+    @test m1 == m2
 end