Cleanup

ITensor · Apr 17, 2024 · 240f8bd · 240f8bd
1 parent 2cc2721
commit 240f8bd
Show file tree

Hide file tree

Showing 4 changed files with 4 additions and 6 deletions.
diff --git a/src/Graphs/abstractgraph.jl b/src/Graphs/abstractgraph.jl
@@ -1,6 +1,7 @@
+# TODO: Move to `Graphs.GraphsExtensions`.
 using Graphs: AbstractGraph, IsDirected, a_star
 using NamedGraphs.GraphsExtensions: child_vertices, is_leaf, undirected_graph, parent_vertex
-using SimpleTraits: @traitfn
+using SimpleTraits: SimpleTraits, Not, @traitfn
 
 """Determine if an edge involves a leaf (at src or dst)"""
 function is_leaf_edge(g::AbstractGraph, e)

diff --git a/src/caches/beliefpropagationcache.jl b/src/caches/beliefpropagationcache.jl
@@ -11,8 +11,7 @@ using NamedGraphs.PartitionedGraphs:
   partitionvertices,
   partitionedges,
   unpartitioned_graph
-using SimpleTraits: SimpleTraits, @traitfn, Not
-using SimpleTraits
+using SimpleTraits: SimpleTraits, Not, @traitfn
 
 default_message(inds_e) = ITensor[denseblocks(delta(inds_e))]
 default_messages(ptn::PartitionedGraph) = Dictionary()

diff --git a/src/edge_sequences.jl b/src/edge_sequences.jl
@@ -3,8 +3,7 @@ using ITensors.NDTensors: Algorithm, @Algorithm_str
 using NamedGraphs: NamedGraphs
 using NamedGraphs.GraphsExtensions: GraphsExtensions, forest_cover, undirected_graph
 using NamedGraphs.PartitionedGraphs: PartitionEdge, PartitionedGraph, partitioned_graph
-using SimpleTraits: SimpleTraits, @traitfn, Not
-using SimpleTraits
+using SimpleTraits: SimpleTraits, Not, @traitfn
 
 default_edge_sequence_alg() = "forest_cover"
 function default_edge_sequence(pg::PartitionedGraph)

diff --git a/src/indsnetwork.jl b/src/indsnetwork.jl
@@ -7,7 +7,6 @@ using NamedGraphs: NamedGraphs, AbstractNamedGraph, NamedEdge, NamedGraph
 using NamedGraphs.GraphsExtensions: vertextype
 using NamedGraphs.NamedGraphGenerators: named_path_graph
 using SimpleTraits: SimpleTraits, Not, @traitfn
-using SimpleTraits
 
 struct IndsNetwork{V,I} <: AbstractIndsNetwork{V,I}
   data_graph::DataGraph{V,Vector{I},Vector{I},NamedGraph{V},NamedEdge{V}}