chore(model): Drop unnecessary checks for visited nodes

When building the dependency graph out of the structure of
`DependencyReference` objects, it is not necessary to test whether a
node has already been visited. The way the structure has been created
ensures that it is free of cycles.

Signed-off-by: Oliver Heger <oliver.heger@bosch.com>

Author: oheger-bosch

model/src/main/kotlin/utils/DependencyGraphBuilder.kt

@@ -504,17 +504,13 @@ private fun Collection<DependencyReference>.toGraph(
 }
 
 private fun Collection<DependencyReference>.visitEach(visit: (ref: DependencyReference) -> Unit) {
-    val visited = mutableSetOf<NodeKey>()
     val queue = LinkedList(this)
 
     while (queue.isNotEmpty()) {
         val ref = queue.removeFirst()
 
-        if (ref.key !in visited) {
-            visit(ref)
-            visited += ref.key
-            queue += ref.dependencies
-        }
+        visit(ref)
+        queue += ref.dependencies
     }
 }