new acceptance implementation: use a pseudo graph traversal
Changing the acceptance workflow should now be simpler - Documentation acceptance graphs transitions have simpler checks - Define a list of MR States, representing the acceptance graphs nodes - Define state transitions and use a simple algorightm to find the state of an MR
graph.go
0 → 100644