The dependency graph for an AQL program must be acyclic for the program to run. The 'Program' datatype contains a graph traversal order, currently set to be whatever order the user enters the bindings in in the AQL program. This issue is to replace that order with a topologically sorted order or to fail with an error when the user enters a cyclic program.
The dependency graph for an AQL program must be acyclic for the program to run. The 'Program' datatype contains a graph traversal order, currently set to be whatever order the user enters the bindings in in the AQL program. This issue is to replace that order with a topologically sorted order or to fail with an error when the user enters a cyclic program.