Ktlint fixes

Author: lillicoder

graphs/src/main/kotlin/com/lillicoder/algorithms/graphs/Graph.kt

@@ -4,15 +4,14 @@ package com.lillicoder.algorithms.graphs
  * Interface for implementations of a [Graph](https://en.wikipedia.org/wiki/Graph_(abstract_data_type)).
  */
 interface Graph<T> : Iterable<T> {
-
     /**
      * Implementation of an [Iterator] for a [Graph] that uses [Traversal.BREADTH_FIRST] order.
      * @param graph Graph to traverse.
      */
     private class BreadthFirstIterator<T>(
         private val graph: Graph<T>,
         root: T = graph.root(),
-    ): Iterator<T> {
+    ) : Iterator<T> {
         private val queue = ArrayDeque(listOf(root))
         private val visited = mutableMapOf(root to true)
 
@@ -65,7 +64,10 @@ interface Graph<T> : Iterable<T> {
      * @param first First element.
      * @param second Second element.
      */
-    fun addEdge(first: T, second: T)
+    fun addEdge(
+        first: T,
+        second: T,
+    )
 
     /**
      * Adds the given element to this graph.
@@ -79,7 +81,10 @@ interface Graph<T> : Iterable<T> {
      * @param second Second element.
      * @return True if there is an edge between the elements, false otherwise.
      */
-    fun adjacent(first: T, second: T): Boolean
+    fun adjacent(
+        first: T,
+        second: T,
+    ): Boolean
 
     /**
      * Determines if this graph contains the given element.
@@ -115,7 +120,10 @@ interface Graph<T> : Iterable<T> {
      * @param first First element.
      * @param second Second element.
      */
-    fun removeEdge(first: T, second: T)
+    fun removeEdge(
+        first: T,
+        second: T,
+    )
 
     /**
      * Removes the given element from this graph.

graphs/src/main/kotlin/com/lillicoder/algorithms/graphs/Traversal.kt

@@ -5,5 +5,5 @@ package com.lillicoder.algorithms.graphs
  */
 enum class Traversal {
     BREADTH_FIRST,
-    DEPTH_FIRST
+    DEPTH_FIRST,
 }

trees/src/main/kotlin/com/lillicoder/algorithms/trees/BinaryNode.kt

@@ -10,5 +10,5 @@ data class BinaryNode<T>(
     val left: BinaryNode<T>? = null,
     val right: BinaryNode<T>? = null,
     override val children: List<Node<T>> = listOfNotNull(left, right),
-    override val count: Int = 0
+    override val count: Int = 0,
 ) : Node<T>