From 493ec4e6c527f7f8e00dd621714c2cd79073af58 Mon Sep 17 00:00:00 2001 From: James Bardin Date: Thu, 5 Aug 2021 15:57:44 -0400 Subject: [PATCH] correct the direction and walk order of the graph --- internal/refactoring/move_execute.go | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/internal/refactoring/move_execute.go b/internal/refactoring/move_execute.go index 011fc9f64..800810981 100644 --- a/internal/refactoring/move_execute.go +++ b/internal/refactoring/move_execute.go @@ -48,12 +48,12 @@ func ApplyMoves(stmts []MoveStatement, state *states.State) map[addrs.UniqueKey] // The starting nodes are the ones that don't depend on any other nodes. startNodes := make(dag.Set, len(stmts)) for _, v := range g.Vertices() { - if len(g.UpEdges(v)) == 0 { + if len(g.DownEdges(v)) == 0 { startNodes.Add(v) } } - g.DepthFirstWalk(startNodes, func(v dag.Vertex, depth int) error { + g.ReverseDepthFirstWalk(startNodes, func(v dag.Vertex, depth int) error { stmt := v.(*MoveStatement) for _, ms := range state.Modules {