8 add simple path and tests

.gitignore

@@ -0,0 +1 @@
+Manifest.toml

Project.toml

@@ -6,16 +6,16 @@ version = "0.1.0"
 [deps]
 DataGraphs = "b5a273c3-7e6c-41f6-98bd-8d7f1525a36a"
 Graphs = "86223c79-3864-5bf0-83f7-82e725a168b6"
-JuliaFormatter = "98e50ef6-434e-11e9-1051-2b60c6c9e899"
 NamedGraphs = "678767b0-92e7-4007-89e4-4527a8725b19"
-Revise = "295af30f-e4ad-537b-8983-00126c2a3abe"
+Random = "9a3f8284-a2c9-5f02-9a11-845980a1fd5c"
 SimpleTensorNetworks = "3075f829-f72e-4896-a859-7fe0a9cabb9b"
 TensorCrossInterpolation = "b261b2ec-6378-4871-b32e-9173bb050604"
 
 [compat]
 DataGraphs = "0.2.5"
 Graphs = "1.12.0"
 NamedGraphs = "0.6.4"
+Random = "1.10"
 SimpleTensorNetworks = "0.1.0"
 TensorCrossInterpolation = "0.9.13"
 

docs/make.jl

@@ -12,10 +12,7 @@ makedocs(;
         edit_link = "main",
         assets = String[],
     ),
-    pages = [
-        "Home" => "index.md",
-        "API Reference" => "api.md"
-    ],
+    pages = ["Home" => "index.md", "API Reference" => "api.md"],
 )
 
 deploydocs(; repo = "github.com/tensor4all/TreeTCI.jl.git", devbranch = "main")

src/TreeTCI.jl

@@ -2,13 +2,25 @@
 module TreeTCI
 import Graphs
 import NamedGraphs:
-    NamedGraph, NamedEdge, is_directed, outneighbors, has_edge, edges, vertices, src, dst, namedgraph_dijkstra_shortest_paths
+    NamedGraph,
+    NamedEdge,
+    is_directed,
+    outneighbors,
+    has_edge,
+    edges,
+    vertices,
+    src,
+    dst,
+    namedgraph_dijkstra_shortest_paths
 import TensorCrossInterpolation as TCI
-import SimpleTensorNetworks: TensorNetwork, IndexedArray, Index, complete_contraction, getindex, contract
-include("tree_utils.jl")
+import SimpleTensorNetworks:
+    TensorNetwork, IndexedArray, Index, complete_contraction, getindex, contract
+import Random: shuffle
+include("treegraph_utils.jl")
 include("simpletci.jl")
-include("simpletci_utils.jl")
 include("pivotcandidateproper.jl")
 include("sweep2sitepathproper.jl")
+include("simpletci_optimize.jl")
+include("simpletci_tensors.jl")
 include("treetensornetwork.jl")
 end

src/pivotcandidateproper.jl

@@ -1,12 +1,12 @@
 """
 Abstract type for pivot candidate generation strategies
 """
-abstract type PivotCandidateProper end
+abstract type AbstractPivotCandidateProper end
 
 """
 Default strategy that uses kronecker product and union with extra indices
 """
-struct DefaultPivotCandidateProper <: PivotCandidateProper end
+struct DefaultPivotCandidateProper <: AbstractPivotCandidateProper end
 
 """
 Default strategy that runs through within all indices of site tensor according to the bond and connect them with IJSet from neighbors
@@ -22,10 +22,10 @@ function generate_pivot_candidates(
     Ikey, subIkey = subtreevertices(tci.g, vq => vp), vp
     Jkey, subJkey = subtreevertices(tci.g, vp => vq), vq
 
-    adjacent_edges_vp = adjacentedges(tci.g, vp; combinededges=edge)
+    adjacent_edges_vp = adjacentedges(tci.g, vp; combinededges = edge)
     InIkeys = edgeInIJkeys(tci.g, vp, adjacent_edges_vp)
 
-    adjacent_edges_vq = adjacentedges(tci.g, vq; combinededges=edge)
+    adjacent_edges_vq = adjacentedges(tci.g, vq; combinededges = edge)
     InJkeys = edgeInIJkeys(tci.g, vq, adjacent_edges_vq)
 
     # Generate base index sets for both sides