Index: TECH/Algo/Graph/DependencyGraph.cls.xml
===================================================================
diff -u
--- TECH/Algo/Graph/DependencyGraph.cls.xml	(revision 0)
+++ TECH/Algo/Graph/DependencyGraph.cls.xml	(revision 1297)
@@ -0,0 +1,143 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<Export generator="Cache" version="9">
+<Class name="TECH.Algo.Graph.DependencyGraph">
+<IncludeCode>TECH.Error</IncludeCode>
+<ProcedureBlock>1</ProcedureBlock>
+<Super>%RegisteredObject</Super>
+<ClassDefinitionError>0</ClassDefinitionError>
+
+<Property name="Nodes">
+<Type>TECH.Algo.Graph.Node</Type>
+<Collection>array</Collection>
+<Private>1</Private>
+</Property>
+
+<Method name="%OnNew">
+<Private>1</Private>
+<ProcedureBlock>1</ProcedureBlock>
+<ReturnType>%Status</ReturnType>
+<Implementation><![CDATA[	Quit $$$OK
+]]></Implementation>
+</Method>
+
+<Method name="AddNode">
+<FormalSpec>Node:TECH.Algo.Graph.Node</FormalSpec>
+<Implementation><![CDATA[	Do ..Nodes.SetAt(Node,Node.Name)
+]]></Implementation>
+</Method>
+
+<Method name="AddDependency">
+<FormalSpec>DependentNode:TECH.Algo.Graph.Node,Node:TECH.Algo.Graph.Node</FormalSpec>
+<Implementation><![CDATA[	Do ..Nodes.GetAt(DependentNode.Name).AddChild(Node)
+]]></Implementation>
+</Method>
+
+<Method name="AddDependencyByNodeName">
+<FormalSpec>DependentName:%String,Name:%String</FormalSpec>
+<Implementation><![CDATA[	Do ..AddDependency(..Nodes.GetAt(DependentName),..Nodes.GetAt(Name))
+]]></Implementation>
+</Method>
+
+<Method name="GetDependencyQueue">
+<ReturnType>%ListOfObjects</ReturnType>
+<Implementation><![CDATA[
+	If (..HasCycle())
+	{
+		$$$ThrowError($$$errGeneralError,"Er zijn cyclische afhankelijkheden aanwezig in de dependency graph")
+	}
+	
+	Set DependencyQueue = ##class(%ListOfObjects).%New()
+	Set Queue = ..GetRootNodes()	
+	Set Visited = ##class(%ArrayOfDataTypes).%New()
+	
+	// Alle nodes bezoeken die bereikbaar zijn vanuit de node die als eerste in de queue zit
+	While (Queue.Size > 0)
+	{
+		Do ..VisitTopologicalSort(Queue.GetAt(1),.Visited,.DependencyQueue)
+		Do Queue.RemoveAt(1)
+	}
+	
+	Quit DependencyQueue
+]]></Implementation>
+</Method>
+
+<Method name="VisitTopologicalSort">
+<FormalSpec><![CDATA[Node:TECH.Algo.Graph.Node,&Visited:%String,&SortedQueue:%ListOfObjects]]></FormalSpec>
+<Implementation><![CDATA[
+	Set Iterator = Node.GetChildrenIterator()
+	While (Iterator.HasNext())
+	{
+		Set NextNode = Iterator.Next()
+		If ($Get(Visited(NextNode.Name)) '= 1)
+		{
+			Do ..VisitTopologicalSort(NextNode,.Visited,.SortedQueue)
+		}
+	}
+	Set Visited(Node.Name) = 1
+	Do SortedQueue.Insert(Node)
+]]></Implementation>
+</Method>
+
+<Method name="GetRootNodes">
+<ReturnType>%ListOfObjects</ReturnType>
+<Implementation><![CDATA[
+	Set Queue = ##class(%ListOfObjects).%New()
+	Set NodesIterator = ##class(TECH.ListIterator).%New(..Nodes)
+	While(NodesIterator.HasNext())
+	{	
+		Set Node = NodesIterator.Next()
+		If (Node.GetIncomingNodesCount() = 0)
+		{
+			Do Queue.Insert(Node)
+		}
+	}
+	Quit Queue
+]]></Implementation>
+</Method>
+
+<Method name="HasCycle">
+<Implementation><![CDATA[
+	Set Queue = ..GetRootNodes()
+	Set HasCycle = ((..Nodes.Count() > 0) && (Queue.Count() = 0))
+	While (('HasCycle) && (Queue.Size > 0))
+	{
+		Set HasCycle = (..VisitCycle(Queue.GetAt(1)) > ..Nodes.Count())
+		Do Queue.RemoveAt(1)
+	}
+	Quit HasCycle
+]]></Implementation>
+</Method>
+
+<Method name="VisitCycle">
+<Description>
+Returns the length of the last visited path, if there is a cycle, it returns the numbers of nodes + 1</Description>
+<FormalSpec>Node:TECH.Algo.Graph.Node,PathLength:%Integer=0</FormalSpec>
+<Private>1</Private>
+<ReturnType>%Integer</ReturnType>
+<Implementation><![CDATA[
+	Set Iterator = Node.GetChildrenIterator()
+	While ((PathLength '> ..Nodes.Count()) && Iterator.HasNext())
+	{
+		Set PathLength = ..VisitCycle(Iterator.Next(),PathLength+1)
+	}
+	Quit PathLength
+]]></Implementation>
+</Method>
+
+<Method name="ConvertToDataQueue">
+<Description>
+Geeft lijst van de Data vertrekkende van de lijst van de Nodes van de Graph.</Description>
+<ClassMethod>1</ClassMethod>
+<FormalSpec>DependencyQueue:%ListOfObjects</FormalSpec>
+<ReturnType>%ListOfObjects</ReturnType>
+<Implementation><![CDATA[
+	Set DependencyDataQueue = ##class(%ListOfObjects).%New()
+	Set NodesIterator=##class(TECH.ListIterator).%New(DependencyQueue)
+	While (NodesIterator.HasNext()) {
+		Do DependencyDataQueue.Insert(NodesIterator.Next().Data)
+	}
+	Quit DependencyDataQueue
+]]></Implementation>
+</Method>
+</Class>
+</Export>
Index: TECH/Algo/Graph/Node.cls.xml
===================================================================
diff -u
--- TECH/Algo/Graph/Node.cls.xml	(revision 0)
+++ TECH/Algo/Graph/Node.cls.xml	(revision 1297)
@@ -0,0 +1,65 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<Export generator="Cache" version="9">
+<Class name="TECH.Algo.Graph.Node">
+<ProcedureBlock>1</ProcedureBlock>
+<Super>%RegisteredObject</Super>
+<ClassDefinitionError>0</ClassDefinitionError>
+
+<Property name="Name">
+<Type>%String</Type>
+</Property>
+
+<Property name="Data">
+<Type>%String</Type>
+</Property>
+
+<Property name="Children">
+<Type>TECH.Algo.Graph.Node</Type>
+<Collection>array</Collection>
+<Private>1</Private>
+</Property>
+
+<Property name="IncomingNodesCount">
+<Type>%Integer</Type>
+<Private>1</Private>
+</Property>
+
+<Method name="%OnNew">
+<FormalSpec>Name:%String,Data:%String=""</FormalSpec>
+<Private>1</Private>
+<ProcedureBlock>1</ProcedureBlock>
+<ReturnType>%Status</ReturnType>
+<Implementation><![CDATA[
+	Set ..Name = Name
+	Set ..Data = Data
+	Set ..IncomingNodesCount = 0
+	Quit $$$OK
+]]></Implementation>
+</Method>
+
+<Method name="AddChild">
+<FormalSpec>Node:TECH.Algo.Graph.Node</FormalSpec>
+<Implementation><![CDATA[
+	Do ..Children.SetAt(Node,Node.Name)
+	Set Node.IncomingNodesCount = Node.IncomingNodesCount+1
+]]></Implementation>
+</Method>
+
+<Method name="GetChildrenIterator">
+<Implementation><![CDATA[	Quit ##class(TECH.ListIterator).%New(..Children)
+]]></Implementation>
+</Method>
+
+<Method name="GetIncomingNodesCount">
+<ReturnType>%Integer</ReturnType>
+<Implementation><![CDATA[	Quit ..IncomingNodesCount
+]]></Implementation>
+</Method>
+
+<Method name="HasChild">
+<FormalSpec>Node:TECH.Algo.Graph.Node</FormalSpec>
+<Implementation><![CDATA[	Quit $IsObject(Children.GetAt(Node.Name))
+]]></Implementation>
+</Method>
+</Class>
+</Export>
Index: DOM/PM/Maatwerk/Calc/HF/HalffabSpec.cls.xml
===================================================================
diff -u -r1075 -r1297
--- DOM/PM/Maatwerk/Calc/HF/HalffabSpec.cls.xml	(.../HalffabSpec.cls.xml)	(revision 1075)
+++ DOM/PM/Maatwerk/Calc/HF/HalffabSpec.cls.xml	(.../HalffabSpec.cls.xml)	(revision 1297)
@@ -74,7 +74,7 @@
 <Private>1</Private>
 <Implementation><![CDATA[
 	// DependencyGraph opbouwen en Nodes invullen 
-	Set DependencyGraph=##class(TECH.Graph.DependencyGraph).%New()
+	Set DependencyGraph=##class(TECH.Algo.Graph.DependencyGraph).%New()
 	Set ItemBuilders=##class(%ArrayOfObjects).%New()
 	Set TraverserList=##class(%ListOfObjects).%New()
 	If ($IsObject(..Builder)) Do TraverserList.Insert(..Builder)
@@ -92,7 +92,7 @@
 		{
 			Set Rol=Builder.GeefRol()
 			Do ItemBuilders.SetAt(Builder,Rol)
-			Do DependencyGraph.AddNode(##class(TECH.Graph.Node).%New(Rol,Builder))
+			Do DependencyGraph.AddNode(##class(TECH.Algo.Graph.Node).%New(Rol,Builder))
 		}
 		Do TraverserList.RemoveAt(1)
 	}
Index: vhUnitTest/TECH/Graph/TestDependencyGraph.cls.xml
===================================================================
diff -u -r1074 -r1297
--- vhUnitTest/TECH/Graph/TestDependencyGraph.cls.xml	(.../TestDependencyGraph.cls.xml)	(revision 1074)
+++ vhUnitTest/TECH/Graph/TestDependencyGraph.cls.xml	(.../TestDependencyGraph.cls.xml)	(revision 1297)
@@ -9,24 +9,24 @@
 
 <Method name="TestVolgorde">
 <Implementation><![CDATA[
-	Set Graph = ##class(TECH.Graph.DependencyGraph).%New()
-	Set Node1 = ##class(TECH.Graph.Node).%New("1",1)
+	Set Graph = ##class(TECH.Algo.Graph.DependencyGraph).%New()
+	Set Node1 = ##class(TECH.Algo.Graph.Node).%New("1",1)
 	Do Graph.AddNode(Node1)
-	Set Node2 = ##class(TECH.Graph.Node).%New("2",1)
+	Set Node2 = ##class(TECH.Algo.Graph.Node).%New("2",1)
 	Do Graph.AddNode(Node2)
-	Set Node3 = ##class(TECH.Graph.Node).%New("3",1)
+	Set Node3 = ##class(TECH.Algo.Graph.Node).%New("3",1)
 	Do Graph.AddNode(Node3)
-	Set Node4 = ##class(TECH.Graph.Node).%New("4",1)
+	Set Node4 = ##class(TECH.Algo.Graph.Node).%New("4",1)
 	Do Graph.AddNode(Node4)
-	Set Node5 = ##class(TECH.Graph.Node).%New("5",1)
+	Set Node5 = ##class(TECH.Algo.Graph.Node).%New("5",1)
 	Do Graph.AddNode(Node5)
-	Set Node6 = ##class(TECH.Graph.Node).%New("6",1)
+	Set Node6 = ##class(TECH.Algo.Graph.Node).%New("6",1)
 	Do Graph.AddNode(Node6)
-	Set Node7 = ##class(TECH.Graph.Node).%New("7",1)
+	Set Node7 = ##class(TECH.Algo.Graph.Node).%New("7",1)
 	Do Graph.AddNode(Node7)
-	Set Node8 = ##class(TECH.Graph.Node).%New("8",1)
+	Set Node8 = ##class(TECH.Algo.Graph.Node).%New("8",1)
 	Do Graph.AddNode(Node8)
-	Set Node9 = ##class(TECH.Graph.Node).%New("9",1)
+	Set Node9 = ##class(TECH.Algo.Graph.Node).%New("9",1)
 	Do Graph.AddNode(Node9)
 	
 	Do Graph.AddDependency(Node3,Node1)   ; Node3 is afhankelijk van Node 1 
FishEye: Tag 1297 refers to a dead (removed) revision in file `TECH/Graph/DependencyGraph.cls.xml'.
FishEye: No comparison available.  Pass `N' to diff?
FishEye: Tag 1297 refers to a dead (removed) revision in file `TECH/Graph/Node.cls.xml'.
FishEye: No comparison available.  Pass `N' to diff?