From fae5efa6fbb2f47968e9555ffef210e41f8d55f4 Mon Sep 17 00:00:00 2001
From: houpc <houpc96@gmail.com>
Date: Fri, 23 Feb 2024 22:48:14 +0800
Subject: [PATCH] update v1.0.1

---
 Project.toml              | 2 +-
 src/frontend/frontends.jl | 8 ++++----
 2 files changed, 5 insertions(+), 5 deletions(-)

diff --git a/Project.toml b/Project.toml
index 99dca66f..de06d941 100644
--- a/Project.toml
+++ b/Project.toml
@@ -1,7 +1,7 @@
 name = "FeynmanDiagram"
 uuid = "e424a512-dbd9-41ff-9883-094748823e72"
 authors = ["Kun Chen", "Pengcheng Hou", "Daniel Cerkoney"]
-version = "1.0.0"
+version = "1.0.1"
 
 [deps]
 AbstractTrees = "1520ce14-60c1-5f80-bbc7-55ef81b5835c"
diff --git a/src/frontend/frontends.jl b/src/frontend/frontends.jl
index bb9a92d8..72ece730 100644
--- a/src/frontend/frontends.jl
+++ b/src/frontend/frontends.jl
@@ -1,6 +1,6 @@
 module FrontEnds
 
-import ..ComputationalGraphs as IR
+import ..ComputationalGraphs 
 import ..ComputationalGraphs: Graph, FeynmanGraph, _dtype
 import ..QuantumOperators
 import ..Taylor
@@ -134,11 +134,11 @@ function leafstates(leaf_maps::Vector{Dict{Int,G}}, labelProd::LabelProduct) whe
         for idx in 1:len_leaves
             g = leafmap[idx]
             vertices = g.properties.vertices
-            if IR.diagram_type(g) == IR.Interaction
+            if ComputationalGraphs.diagram_type(g) == ComputationalGraphs.Interaction
                 In = Out = vertices[1][1].label
                 push!(leafType[ikey], 0)
                 push!(leafLoopIndex[ikey], 1)
-            elseif IR.diagram_type(g) == IR.Propagator
+            elseif ComputationalGraphs.diagram_type(g) == ComputationalGraphs.Propagator
                 if (Op.isfermionic(vertices[1]))
                     In, Out = vertices[2][1].label, vertices[1][1].label
                     # push!(leafType[ikey], g.orders[1] * 2 + 1)
@@ -197,7 +197,7 @@ function leafstates(leaf_maps::Vector{Dict{Int,G}}, maxloopNum::Int) where {G<:G
 
         for idx in 1:len_leaves
             leaf = leafmap[idx]
-            @assert IR.isleaf(leaf)
+            @assert ComputationalGraphs.isleaf(leaf)
             diagId, leaf_orders = leaf.properties, leaf.orders
             loopmom = copy(diagId.extK)
             len = length(loopmom)