upgrade libs

Author: jemshit

build.gradle

@@ -1,31 +1,28 @@
 plugins {
     id 'java'
-    id 'org.jetbrains.kotlin.jvm' version '1.3.50'
+    id "org.jetbrains.kotlin.jvm" version "1.6.21"
 }
 
 group 'com.jemshit'
 version '1.0'
 
-sourceCompatibility = 1.8
-
 repositories {
     mavenCentral()
 }
 
-dependencies {
-    implementation "org.jetbrains.kotlin:kotlin-stdlib-jdk8"
-
-    testImplementation 'org.junit.jupiter:junit-jupiter-api:5.4.2'
-    testRuntimeOnly 'org.junit.jupiter:junit-jupiter-engine:5.4.2'
-}
-
 compileKotlin {
     kotlinOptions.jvmTarget = "1.8"
 }
 compileTestKotlin {
     kotlinOptions.jvmTarget = "1.8"
 }
-
 test {
     useJUnitPlatform()
-}
+}
+
+dependencies {
+    implementation "org.jetbrains.kotlin:kotlin-stdlib-jdk8:1.6.21"
+
+    testImplementation 'org.junit.jupiter:junit-jupiter-api:5.4.2'
+    testRuntimeOnly 'org.junit.jupiter:junit-jupiter-engine:5.4.2'
+}

gradle/wrapper/gradle-wrapper.properties

@@ -1,5 +1,5 @@
 distributionBase=GRADLE_USER_HOME
 distributionPath=wrapper/dists
-distributionUrl=https\://services.gradle.org/distributions/gradle-5.2.1-bin.zip
+distributionUrl=https\://services.gradle.org/distributions/gradle-7.2-bin.zip
 zipStoreBase=GRADLE_USER_HOME
 zipStorePath=wrapper/dists

src/main/kotlin/graph/ShortestPathDAG.kt

@@ -1,18 +1,18 @@
 package graph
 
 fun GraphUsingAdjacencyList.shortestPathDAG(): Array<Int> {
-    val shortestPaths = arrayOfNulls<Int>(nodeCount)
+    val shortestPaths = Array<Int>(nodeCount) { 0 }
     val topologicalOrdering = this.topologicalOrdering()
     shortestPaths[0] = 0
     for (node in topologicalOrdering) {
         val edges = getEdges(node)
         for (edge in edges) {
             val neighbour = edge.end
-            val distanceToNeighbour = (shortestPaths[node] ?: 0) + (edge.weight ?: 0)
-            if (shortestPaths[neighbour] == null || distanceToNeighbour < shortestPaths[neighbour]!!) {
+            val distanceToNeighbour = shortestPaths[node] + (edge.weight ?: 0)
+            if (distanceToNeighbour < shortestPaths[neighbour]) {
                 shortestPaths[neighbour] = distanceToNeighbour
             }
         }
     }
-    return shortestPaths as Array<Int>
+    return shortestPaths
 }