allow parallel edges in merge prim func

kendryte · Mar 3, 2025 · 7b64c5a · 7b64c5a
1 parent c0312cf
commit 7b64c5a
Show file tree

Hide file tree

Showing 2 changed files with 8 additions and 1 deletion.
diff --git a/src/Nncase.Graph/Graphs/CondensationGraphAlgorithm.cs b/src/Nncase.Graph/Graphs/CondensationGraphAlgorithm.cs
@@ -61,7 +61,7 @@ public CondensationGraphAlgorithm(IEdgeListAndIncidenceGraph<TVertex, TEdge> vis
         : base(visitedGraph)
     {
         CondensedGraph = new(true);
-        WrappedGraph = new(false);
+        WrappedGraph = new(true);
         ClusteredGraph = new(WrappedGraph);
         VertexMap = new Dictionary<TVertex, ClusteredBidirectionalGraph<TVertex, TEdge>>();
         EdgeMap = new(ReferenceEqualityComparer.Instance);

diff --git a/src/Nncase.Passes/GraphPartition/ExprReConstructor.cs b/src/Nncase.Passes/GraphPartition/ExprReConstructor.cs
@@ -40,8 +40,14 @@ public Expr Construct()
     protected virtual IEnumerable<(Expr Pre, Expr Post)> GetClusterArgumentPairs(ClusteredBidirectionalGraph<TVertex, TEdge> cluster)
     {
         var pairs = new List<(Expr Pre, Expr Post)>();
+        var preSet = new HashSet<Expr>(ReferenceEqualityComparer.Instance);
         foreach (var inEdge in cluster.InEdges(Algo.ClusteredGraph))
         {
+            if (preSet.Contains(inEdge.Source.Expr))
+            {
+                continue;
+            }
+
             // get in Expr
             Expr postArg;
             var sourceCluster = Algo.VertexMap[inEdge.Source];
@@ -57,6 +63,7 @@ public Expr Construct()
                 postArg = postResult is IR.Tuple tp ? tp.Fields[sourceOutIndex] : IR.F.Tensors.GetItem(postResult, sourceOutIndex);
             }
 
+            preSet.Add(inEdge.Source.Expr);
             pairs.Add((inEdge.Source.Expr, postArg));
         }