opentofu/dag
James Bardin bfa6ab4617 Fix removeEdge test failures
The removeEdge test could fail intermittently with the wrong order.

The precondition of a 1->2->3 order wasn't met, because there was no
edge from 1->3, so 3->1->2 was also a valid ordering.

The other failure was a bookkeeping error, were the recorded order may
not match the visited order. What happened in this case was the gateCh
was closed by V2, allowing V3 to run which could beat V2 to recording
its visit. Now the visit is recorded as part of the vertex walk, and the
gate is released as the final operation.

The order is deterministic now, so remove the brute-force test loop.
2017-02-20 19:54:34 -05:00
..
dag_test.go Silence log output when not verbose 2016-08-01 17:19:14 -04:00
dag.go dag: require acyclic graph 2017-02-03 21:18:34 +01:00
dot_test.go dag: string DotOpts through to vertex 2017-01-08 11:59:18 -08:00
dot.go dag: string DotOpts through to vertex 2017-01-08 11:59:18 -08:00
edge_test.go dag: Remove, RemoveEdge, DownEdges, UpEdges 2015-02-19 12:07:54 -08:00
edge.go dag: export more things 2015-02-19 12:08:07 -08:00
graph_test.go dag: test for EdgesFrom, EdgesTo 2016-10-19 13:38:53 -07:00
graph.go Add DebugVisitInfo 2016-11-15 10:39:08 -05:00
marshal_test.go dag: call into DotNode to get attributes 2016-12-03 15:17:14 -08:00
marshal.go dag: call into DotNode to get attributes 2016-12-03 15:17:14 -08:00
set_test.go dag: Set difference 2017-02-03 21:18:33 +01:00
set.go dag: Set difference 2017-02-03 21:18:33 +01:00
tarjan_test.go dag: Remove, RemoveEdge, DownEdges, UpEdges 2015-02-19 12:07:54 -08:00
tarjan.go dag: fix walk order issue, scc issues 2015-02-19 12:07:55 -08:00
walk_test.go Fix removeEdge test failures 2017-02-20 19:54:34 -05:00
walk.go dag: require acyclic graph 2017-02-03 21:18:34 +01:00