11using Dictionaries: Indices
22using Graphs: dst, edges, has_edge, ne, nv, src, vertices
3- # TODO : Move `arranged_edges` to `NamedGraphs.GraphsExtensions`.
4- using ITensorNetworksNext: TensorNetwork, arranged_edges, linkaxes, linkinds, siteinds
3+ using ITensorNetworksNext: TensorNetwork, linkinds, siteinds
54using ITensorBase: Index
65using NamedDimsArrays: dimnames
7- using NamedGraphs. GraphsExtensions: incident_edges
6+ using NamedGraphs. GraphsExtensions: arranged_edges, incident_edges
87using NamedGraphs. NamedGraphGenerators: named_grid
98using Test: @test , @testset
109
@@ -31,18 +30,16 @@ using Test: @test, @testset
3130 end
3231 end
3332 for e in edges (tn)
34- @test isone (length (linkaxes ( tn, e)))
33+ @test isone (length (only ( linkinds ( tn, e) )))
3534 end
3635 end
3736 @testset " Construct TensorNetwork partition function" begin
3837 dims = (3 , 3 )
3938 g = named_grid (dims)
4039 l = Dict (e => Index (2 ) for e in edges (g))
40+ l = merge (l, Dict (reverse (e) => l[e] for e in edges (g)))
4141 tn = TensorNetwork (g) do v
42- is = map (incident_edges (g, v)) do e
43- # TODO : Use `dual` on reverse edges.
44- return haskey (l, e) ? l[e] : l[reverse (e)]
45- end
42+ is = map (e -> l[e], incident_edges (g, v))
4643 return randn (Tuple (is))
4744 end
4845 @test nv (tn) == 9
@@ -60,7 +57,7 @@ using Test: @test, @testset
6057 end
6158 end
6259 for e in edges (tn)
63- @test isone ( length ( linkaxes ( tn, e)))
60+ @test only ( linkinds ( tn, e)) == l[e]
6461 end
6562 end
6663end
0 commit comments