bfa6ab4617
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. |
||
|---|---|---|
| .. | ||
| dag.go | ||
| dag_test.go | ||
| dot.go | ||
| dot_test.go | ||
| edge.go | ||
| edge_test.go | ||
| graph.go | ||
| graph_test.go | ||
| marshal.go | ||
| marshal_test.go | ||
| set.go | ||
| set_test.go | ||
| tarjan.go | ||
| tarjan_test.go | ||
| walk.go | ||
| walk_test.go | ||