TECH.Error 1 %RegisteredObject 62053,29396.679366 0 TECH.Graph.Node array 1 1 1 %Status Node:TECH.Graph.Node DependentNode:TECH.Graph.Node,Node:TECH.Graph.Node DependentName:%String,Name:%String %ListOfObjects 0) { Do ..VisitTopologicalSort(Queue.GetAt(1),.Visited,.DependencyQueue) Do Queue.RemoveAt(1) } Quit DependencyQueue ]]> %ListOfObjects 0) && (Queue.Count() = 0)) While (('HasCycle) && (Queue.Size > 0)) { Set HasCycle = (..VisitCycle(Queue.GetAt(1)) > ..Nodes.Count()) Do Queue.RemoveAt(1) } Quit HasCycle ]]> Returns the length of the last visited path, if there is a cycle, it returns the numbers of nodes + 1 Node:TECH.Graph.Node,PathLength:%Integer=0 1 %Integer ..Nodes.Count()) && Iterator.HasNext()) { Set PathLength = ..VisitCycle(Iterator.Next(),PathLength+1) } Quit PathLength ]]> Geeft lijst van de Data vertrekkende van de lijst van de Nodes van de Graph. 1 DependencyQueue:%ListOfObjects %ListOfObjects