update Graphs

Author: GiggleLiu

Project.toml

@@ -1,14 +1,14 @@
 name = "GraphTensorNetworks"
 uuid = "0978c8c2-34f6-49c7-9826-ea2cc20dabd2"
 authors = ["GiggleLiu <cacate0129@gmail.com> and contributors"]
-version = "0.1.0"
+version = "0.1.1"
 
 [deps]
 CUDA = "052768ef-5323-5732-b1bb-66c8b64840ba"
 Compose = "a81c6b42-2e10-5240-aca2-a61377ecd94b"
 DelimitedFiles = "8bb1440f-4735-579b-a4ab-409b98df4dab"
 FFTW = "7a1cc6ca-52ef-59f5-83cd-3a7055c09341"
-LightGraphs = "093fc24a-ae57-5d10-9952-331d41423f4d"
+Graphs = "86223c79-3864-5bf0-83f7-82e725a168b6"
 LinearAlgebra = "37e2e46d-f89d-539d-b4ee-838fcccc9c8e"
 Mods = "7475f97c-0381-53b1-977b-4c60186c8d62"
 OMEinsum = "ebe7aa44-baf0-506c-a96f-8464559b3922"
@@ -25,7 +25,7 @@ Viznet = "52a3aca4-6234-47fd-b74a-806bdf78ede9"
 CUDA = "3.5"
 Compose = "0.9"
 FFTW = "1.4"
-LightGraphs = "1.3"
+Graphs = "1.4"
 Mods = "1.3"
 OMEinsum = "0.6.1"
 OMEinsumContractionOrders = "0.5"

README.md

@@ -36,9 +36,9 @@ end
 
 Let us use the Petersen graph as an example, we first generate its tensor network contraction tree.
 ```julia
-julia> using GraphTensorNetworks, Random, LightGraphs
+julia> using GraphTensorNetworks, Random, Graphs
 
-julia> graph = (Random.seed!(2); LightGraphs.smallgraph(:petersen))
+julia> graph = (Random.seed!(2); Graphs.smallgraph(:petersen))
 {10, 15} undirected simple Int64 graph
 
 julia> problem = Independence(graph; optimizer=TreeSA(sc_target=0, sc_weight=1.0, ntrials=10, βs=0.01:0.1:15.0, niters=20, rw_weight=0.2));

notebooks/tropicalwidget_simple.jl

@@ -18,7 +18,7 @@ begin
 	using Revise
 	using Pkg
 	Pkg.activate(dirname(pwd()))
-	using LightGraphs # graph support
+	using Graphs # graph support
 	using PlutoUI
 	using Viznet, Compose
 	using TropicalNumbers, OMEinsum, GraphTensorNetworks#, TropicalGEMM

src/GraphTensorNetworks.jl

@@ -5,7 +5,7 @@ using Core: Argument
 using TropicalGEMM, TropicalNumbers
 using OMEinsum
 using OMEinsum: timespace_complexity, collect_ixs
-using LightGraphs
+using Graphs
 
 export timespace_complexity, @ein_str
 export GreedyMethod, TreeSA, SABipartite, KaHyParBipartite, MergeVectors, MergeGreedy

src/graph_polynomials.jl

@@ -1,7 +1,7 @@
 using Polynomials
 using OMEinsum: NestedEinsum, getixs, getiy
 using FFTW
-using LightGraphs
+using Graphs
 
 export contractx, contractf, graph_polynomial, max_size, max_size_count
 

src/graphs.jl

@@ -1,4 +1,4 @@
-using LightGraphs, OMEinsumContractionOrders
+using Graphs, OMEinsumContractionOrders
 export random_regular_graph, diagonal_coupled_graph, isindependentset
 export square_lattice_graph, unitdisk_graph
 

src/networks.jl

@@ -15,8 +15,8 @@ struct Independence{CT<:EinTypes} <: GraphProblem
 end
 
 function Independence(g::SimpleGraph; openvertices=(), optimizer=GreedyMethod(), simplifier=nothing)
-    rawcode = EinCode(([(i,) for i in LightGraphs.vertices(g)]..., # labels for vertex tensors
-                    [minmax(e.src,e.dst) for e in LightGraphs.edges(g)]...), openvertices)  # labels for edge tensors
+    rawcode = EinCode(([(i,) for i in Graphs.vertices(g)]..., # labels for vertex tensors
+                    [minmax(e.src,e.dst) for e in Graphs.edges(g)]...), openvertices)  # labels for edge tensors
     code = _optimize_code(rawcode, uniformsize(rawcode, 2), optimizer, simplifier)
     Independence(code)
 end
@@ -32,7 +32,7 @@ struct MaxCut{CT<:EinTypes} <: GraphProblem
     code::CT
 end
 function MaxCut(g::SimpleGraph; openvertices=(), optimizer=GreedyMethod(), simplifier=nothing)
-    rawcode = EinCode(([minmax(e.src,e.dst) for e in LightGraphs.edges(g)]...,), openvertices)  # labels for edge tensors
+    rawcode = EinCode(([minmax(e.src,e.dst) for e in Graphs.edges(g)]...,), openvertices)  # labels for edge tensors
     MaxCut(_optimize_code(rawcode, uniformsize(rawcode, 2), optimizer, simplifier))
 end
 
@@ -48,7 +48,7 @@ struct MaximalIndependence{CT<:EinTypes} <: GraphProblem
 end
 
 function MaximalIndependence(g::SimpleGraph; openvertices=(), optimizer=GreedyMethod(), simplifier=nothing)
-    rawcode = EinCode(([(LightGraphs.neighbors(g, v)..., v) for v in LightGraphs.vertices(g)]...,), openvertices)
+    rawcode = EinCode(([(Graphs.neighbors(g, v)..., v) for v in Graphs.vertices(g)]...,), openvertices)
     MaximalIndependence(_optimize_code(rawcode, uniformsize(rawcode, 2), optimizer, simplifier))
 end
 
@@ -69,8 +69,8 @@ struct Matching{CT<:EinTypes} <: GraphProblem
 end
 
 function Matching(g::SimpleGraph; openvertices=(), optimizer=GreedyMethod(), simplifier=nothing)
-    rawcode = EinCode(([(minmax(e.src,e.dst),) for e in LightGraphs.edges(g)]..., # labels for edge tensors
-                    [([minmax(i,j) for j in neighbors(g, i)]...,) for i in LightGraphs.vertices(g)]...,), openvertices)       # labels for vertex tensors
+    rawcode = EinCode(([(minmax(e.src,e.dst),) for e in Graphs.edges(g)]..., # labels for edge tensors
+                    [([minmax(i,j) for j in neighbors(g, i)]...,) for i in Graphs.vertices(g)]...,), openvertices)       # labels for vertex tensors
     Matching(_optimize_code(rawcode, uniformsize(rawcode, 2), optimizer, simplifier))
 end
 

src/viz.jl

@@ -3,7 +3,7 @@ export vizeinsum, vizconfig
 using Compose
 
 function vizconfig(g::SimpleGraph; locs, config=zeros(Int, length(locs)), unit=1.0, graphsize=12cm, radius=0.03)
-    vizconfig([string(v)=>locs[v] for v in LightGraphs.vertices(g)], [(e.src, e.dst) for e in edges(g)]; config=config, unit=unit, graphsize=graphsize, radius=radius)
+    vizconfig([string(v)=>locs[v] for v in Graphs.vertices(g)], [(e.src, e.dst) for e in edges(g)]; config=config, unit=unit, graphsize=graphsize, radius=radius)
 end
 
 function vizconfig(nodes, edges; config=zeros(Int, length(nodes)), unit=1.0, graphsize=12cm, radius=0.03)

test/arithematics.jl

@@ -1,6 +1,6 @@
 using GraphTensorNetworks, Test, OMEinsum, OMEinsumContractionOrders
 using Mods, Polynomials, TropicalNumbers
-using LightGraphs, Random
+using Graphs, Random
 using GraphTensorNetworks: StaticBitVector
 
 @testset "truncated poly" begin

test/configurations.jl

@@ -1,4 +1,4 @@
-using GraphTensorNetworks, Test, LightGraphs
+using GraphTensorNetworks, Test, Graphs
 using OMEinsum
 using TropicalNumbers: CountingTropicalF64