m

pom.xml

@@ -7,7 +7,7 @@
     <artifactId>kt-helper</artifactId>
     <groupId>org.vorpal.research</groupId>
     <packaging>jar</packaging>
-    <version>0.1.13</version>
+    <version>0.1.14</version>
 
     <properties>
         <jvm.version>1.8</jvm.version>

src/main/kotlin/org/vorpal/research/kthelper/files.kt

@@ -5,6 +5,7 @@ package org.vorpal.research.kthelper
 import java.io.ByteArrayOutputStream
 import java.io.File
 import java.io.InputStream
+import java.nio.file.Path
 
 private const val MAX_BYTE_ARRAY_SIZE = 16384
 
@@ -22,3 +23,11 @@ val InputStream.asByteArray: ByteArray get() {
 }
 
 fun File.write(input: InputStream) = this.writeBytes(input.asByteArray)
+
+fun Path.resolve(vararg names: String): Path {
+    var current = this
+    for (name in names) {
+        current = current.resolve(name)
+    }
+    return current
+}

src/main/kotlin/org/vorpal/research/kthelper/graph/GraphTraversal.kt

@@ -3,7 +3,7 @@ package org.vorpal.research.kthelper.graph
 import org.vorpal.research.kthelper.KtException
 import org.vorpal.research.kthelper.collection.queueOf
 import org.vorpal.research.kthelper.collection.stackOf
-import java.util.ArrayDeque
+import java.util.*
 
 class NoTopologicalSortingException(msg: String) : KtException(msg)
 
@@ -81,4 +81,15 @@ class GraphTraversal<T : Graph.Vertex<T>>(private val graph: Graph<T>) {
     }
 
     fun topologicalSort(start: T = graph.entry): List<T> = topologicalSort(start) { it }
+
+    fun components(): Pair<UInt, Map<T, UInt>> {
+        var componentNumber = 0U
+        val components = mutableMapOf<T, UInt>()
+        for (node in graph.nodes) {
+            if (node in components) continue
+            dfs(node) { components[it] = componentNumber }
+            ++componentNumber
+        }
+        return (componentNumber + 1U) to components
+    }
 }