diff --git a/library/build.gradle.kts b/library/build.gradle.kts
index eff7136..d0f858f 100644
--- a/library/build.gradle.kts
+++ b/library/build.gradle.kts
@@ -12,6 +12,19 @@ plugins {
 group = "io.github.linde9821"
 version = "0.4.0"
 
+dokka {
+    moduleName.set("TreeLayoutKMP")
+
+    dokkaSourceSets.configureEach {
+        includes.from("src/commonMain/kotlin/io/github/linde9821/treelayout/Module.md")
+        sourceLink {
+            localDirectory.set(file("src/commonMain/kotlin"))
+            remoteUrl("https://github.com/linde9821/TreeLayoutKMP/blob/main/library/src/commonMain/kotlin")
+            remoteLineSuffix.set("#L")
+        }
+    }
+}
+
 kotlin {
     explicitApi()
     jvmToolchain(17)
diff --git a/library/src/commonMain/kotlin/io/github/linde9821/treelayout/Module.md b/library/src/commonMain/kotlin/io/github/linde9821/treelayout/Module.md
new file mode 100644
index 0000000..a971056
--- /dev/null
+++ b/library/src/commonMain/kotlin/io/github/linde9821/treelayout/Module.md
@@ -0,0 +1,41 @@
+# Module TreeLayoutKMP
+
+A Kotlin Multiplatform library for computing tidy tree layouts using the Walker/Buchheim algorithm in O(n) time.
+
+## Getting Started
+
+Create a [TreeAdapter][io.github.linde9821.treelayout.TreeAdapter] for your tree structure, then pass it to [WalkerTreeLayout][io.github.linde9821.treelayout.walker.WalkerTreeLayout]:
+
+```kotlin
+val layout = WalkerTreeLayout(adapter, WalkerLayoutConfiguration(horizontalDistance = 2f))
+val result = layout.layout()
+val position = result.getPosition(myNode)
+```
+
+## Layout Algorithms
+
+| Algorithm | Class | Use Case |
+|-----------|-------|----------|
+| Walker (Buchheim) | [WalkerTreeLayout][io.github.linde9821.treelayout.walker.WalkerTreeLayout] | Standard tidy tree layout |
+| Radial Walker | [RadialWalkerTreeLayout][io.github.linde9821.treelayout.radial.walker.RadialWalkerTreeLayout] | Concentric ring layout |
+| Direct Angular | [DirectAngularPlacementLayout][io.github.linde9821.treelayout.radial.angular.DirectAngularPlacementLayout] | Proportional angular partitioning |
+
+# Package io.github.linde9821.treelayout
+
+Core interfaces and data types for tree layout computation.
+
+# Package io.github.linde9821.treelayout.walker
+
+Walker/Buchheim O(n) tidy tree layout algorithm.
+
+# Package io.github.linde9821.treelayout.radial.walker
+
+Radial variant of the Walker algorithm placing nodes on concentric rings.
+
+# Package io.github.linde9821.treelayout.radial.angular
+
+Direct angular partitioning layout for radial trees.
+
+# Package io.github.linde9821.treelayout.result
+
+Layout result types and bounding box utilities.