Additions needed for sweeping algorithms on trees

Project.toml

@@ -9,11 +9,14 @@ Dictionaries = "85a47980-9c8c-11e8-2b9f-f7ca1fa99fb4"
 DocStringExtensions = "ffbed154-4ef7-542d-bbb7-c09d3a79fcae"
 Graphs = "86223c79-3864-5bf0-83f7-82e725a168b6"
 ITensors = "9136182c-28ba-11e9-034c-db9fb085ebd5"
+IsApprox = "28f27b66-4bd8-47e7-9110-e2746eb8bed7"
 LinearAlgebra = "37e2e46d-f89d-539d-b4ee-838fcccc9c8e"
 MultiDimDictionaries = "87ff4268-a46e-478f-b30a-76b83dd64e3c"
 NamedGraphs = "678767b0-92e7-4007-89e4-4527a8725b19"
 Requires = "ae029012-a4dd-5104-9daa-d747884805df"
+SparseArrayKit = "a9a3c162-d163-4c15-8926-b8794fbefed2"
 SplitApplyCombine = "03a91e81-4c3e-53e1-a0a4-9c0c8f19dd66"
+StaticArrays = "90137ffa-7385-5640-81b9-e52037218182"
 Suppressor = "fd094767-a336-5f1f-9728-57cf17d0bbfb"
 
 [compat]

README.md

@@ -2,11 +2,13 @@
 
 A package to provide general network data structures and tools to use with ITensors.jl.
 
-
+This particular branch contains a draft of the extensions needed to implement sweeping
+algorithms for tree tensor networks.
 
 ## Installation
 
-This package relies on a few unregistered packages. To install, you will need to do:
+This package relies on a few unregistered packages. To install this version, you will need
+to do:
 
 ```julia
 julia> using Pkg
@@ -17,7 +19,7 @@ julia> Pkg.add(url="https://github.com/mtfishman/NamedGraphs.jl")
 
 julia> Pkg.add(url="https://github.com/mtfishman/DataGraphs.jl")
 
-julia> Pkg.add(url="https://github.com/mtfishman/ITensorNetworks.jl")
+julia> Pkg.add(url="https://github.com/leburgel/ITensorNetworks.jl#tree_sweeping")
 ```
 
 

src/ITensorNetworks.jl

@@ -4,17 +4,20 @@ using DataGraphs
 using Dictionaries
 using DocStringExtensions
 using Graphs
+using IsApprox
 using ITensors
 using ITensors.ContractionSequenceOptimization
 using ITensors.ITensorVisualizationCore
 using MultiDimDictionaries
 using NamedGraphs
 using Requires
+using SparseArrayKit
 using SplitApplyCombine
+using StaticArrays
 using Suppressor
 
 # TODO: export from ITensors
-using ITensors: commontags, @Algorithm_str, Algorithm
+using ITensors: commontags, @Algorithm_str, Algorithm, OneITensor
 
 using Graphs: AbstractEdge, AbstractGraph, Graph, add_edge!
 using MultiDimDictionaries: IndexType, SliceIndex
@@ -110,7 +113,6 @@ const UniformDataGraph{D} = NamedDimDataGraph{
 }
 
 include("utils.jl")
-include("namedgraphs.jl")
 include("itensors.jl")
 include("partition.jl")
 include("lattices.jl")
@@ -125,7 +127,14 @@ include("expect.jl")
 include("models.jl")
 include("tebd.jl")
 include("itensornetwork.jl")
-include(joinpath("treetensornetwork", "treetensornetwork.jl"))
+include(joinpath("treetensornetwork", "abstracttreetensornetwork.jl"))
+include(joinpath("treetensornetwork", "ttns.jl"))
+include(joinpath("treetensornetwork", "ttno.jl"))
+include(joinpath("treetensornetwork", "opsum_to_ttno.jl"))
+include(joinpath("treetensornetwork", "abstractprojttno.jl"))
+include(joinpath("treetensornetwork", "projttno.jl"))
+include(joinpath("treetensornetwork", "projttnosum.jl"))
+include("utility.jl")
 
 include("exports.jl")
 

src/abstractindsnetwork.jl

@@ -11,6 +11,8 @@ is_directed(::Type{<:AbstractIndsNetwork}) = false
 vertex_data(graph::AbstractIndsNetwork, args...) = vertex_data(data_graph(graph), args...)
 edge_data(graph::AbstractIndsNetwork, args...) = edge_data(data_graph(graph), args...)
 
+to_vertex(tn::AbstractIndsNetwork, args...) = to_vertex(underlying_graph(tn), args...)
+
 # 
 # Index access
 #