Acyclic fix

modules/aql/types.go

@@ -162,12 +162,6 @@ func (aqlq AQLquery) Resolve(opts ResolverOptions) (*graph.Graph[*engine.Object,
 	// Iterate over all starting nodes
 	aqlq.sourceCache[nodeindex].IterateParallel(func(o *engine.Object) bool {
 		searchResult := graph.NewGraph[*engine.Object, engine.EdgeBitmap]()
-		if aqlq.Mode == Acyclic {
-			aqlq.sourceCache[nodeindex].Iterate(func(node *engine.Object) bool {
-				searchResult.AddNode(node)
-				return true
-			})
-		}
 		aqlq.resolveEdgesFrom(opts, &searchResult, nil, o, 0, 0, 0, 1)
 		resultlock.Lock()
 		result.Merge(searchResult)
@@ -210,8 +204,14 @@ func (aqlq AQLquery) resolveEdgesFrom(
 		directions = directionsAny
 	}
 	// We don't need matches, so try skipping this one
-	if es.MinIterations == 0 && currentDepth == 0 && len(aqlq.Sources) > currentSearchIndex+1 {
-		aqlq.resolveEdgesFrom(opts, committedGraph, workingGraph, currentObject, currentSearchIndex+1, 0, currentTotalDepth+1, currentOverAllProbability)
+	if es.MinIterations == 0 && currentDepth == 0 {
+		if len(aqlq.Sources) > currentSearchIndex+1 {
+			aqlq.resolveEdgesFrom(opts, committedGraph, workingGraph, currentObject, currentSearchIndex+1, 0, currentTotalDepth+1, currentOverAllProbability)
+		} else {
+			// can't go deeper, it's the last one and it isn't required, so we're done :-)
+			committedGraph.Merge(*workingGraph)
+			return
+		}
 	}
 	// Then look for stuff that match in within the min and max iteration requirements
 	for _, direction := range directions {