Add subproject sample

Author: Jegors Cemisovs

.gitignore

@@ -34,3 +34,4 @@ out/
 ##############################
 .DS_Store
 /algorithm/gradle.properties
+/sample/gradle.properties

.idea/jarRepositories.xml

@@ -18,7 +18,7 @@ publishing {
         // The target repository
         maven {
             // Choose whatever name you want
-            name = "algorithms"
+            name = "Algorithms"
             // The url of the repository, where the artifacts will be published
             url = "https://maven.pkg.github.com/rabestro/algorithms"
             credentials {

algorithm/build.gradle

@@ -1,29 +1,3 @@
-plugins {
-    id 'groovy'
-    id 'java'
-}
-
 group 'lv.id.jc'
 version '1.1'
 
-repositories {
-    mavenCentral()
-}
-
-dependencies {
-    // Spock Framework
-    testImplementation 'org.spockframework:spock-core:2.0-groovy-3.0'
-    testImplementation 'org.codehaus.groovy:groovy-all:3.0.9'
-
-    // Spock Reports
-    testRuntimeClasspath( "com.athaydes:spock-reports:2.1.1-groovy-3.0" ) {
-        transitive = false // this avoids affecting your version of Groovy/Spock
-    }
-    // Required for spock-reports
-    testImplementation 'org.slf4j:slf4j-api:1.7.32'
-    testRuntimeClasspath 'org.slf4j:slf4j-simple:1.7.32'
-}
-
-test {
-    useJUnitPlatform()
-}

build.gradle

@@ -6,10 +6,26 @@ plugins {
 group 'lv.id.jc'
 version '1.1'
 
+sourceCompatibility = JavaVersion.VERSION_17
+
 repositories {
     mavenCentral()
+
+    maven {
+        // Choose whatever name you like
+        name = "Algorithms"
+        // The url of the repository that contains the published artifacts
+        url = "https://maven.pkg.github.com/rabestro/algorithms"
+        credentials {
+            // The credentials (described in the next section)
+            username = project.findProperty("gpr.user")
+            password = project.findProperty("gpr.key")
+        }
+    }
 }
 
 dependencies {
     implementation 'org.codehaus.groovy:groovy-all:3.0.9'
+
+    compileOnly  'lv.id.jc:algorithm:1.1'
 }

sample/build.gradle

@@ -0,0 +1,51 @@
+package lv.id.jc.sample;
+
+import lv.id.jc.algorithm.graph.BreadthFirstSearch;
+import lv.id.jc.algorithm.graph.DijkstrasAlgorithm;
+import lv.id.jc.algorithm.graph.Graph;
+import lv.id.jc.algorithm.graph.SearchAlgorithm;
+
+import java.util.Map;
+
+import static java.lang.System.*;
+
+public class GraphApp {
+    private static final Graph<Character> COMPLEX_GRAPH = Graph.of(Map.of(
+            'A', Map.of('B', 5, 'H', 2),
+            'B', Map.of('A', 5, 'C', 7),
+            'C', Map.of('B', 7, 'D', 3, 'G', 4),
+            'D', Map.of('C', 20, 'E', 4),
+            'E', Map.of('F', 5),
+            'F', Map.of('G', 6),
+            'G', Map.of('C', 4),
+            'H', Map.of('G', 3)
+    ));
+    private static final SearchAlgorithm<Character> fastest = new DijkstrasAlgorithm<>();
+    private static final SearchAlgorithm<Character> shortest = new BreadthFirstSearch<>();
+
+    public static void main(String[] args) {
+        out.println(COMPLEX_GRAPH);
+
+        printRoute(COMPLEX_GRAPH, 'D', 'C');
+        printRoute(COMPLEX_GRAPH, 'A', 'G');
+        printRoute(COMPLEX_GRAPH, 'D', 'H');
+    }
+
+    private static void printRoute(final Graph<Character> graph,
+                                   final Character source,
+                                   final Character target) {
+        final var routeOne = shortest.findPath(graph, source, target);
+        final var routeTwo = fastest.findPath(graph, source, target);
+        final var message = """
+                        
+                Find the path from %s to %s
+                    - the shortest take %.0f min and the path is %s
+                    - the fastest take %.0f min and the path is %s"""
+                .formatted(
+                        source, target,
+                        graph.getDistance(routeOne), routeOne,
+                        graph.getDistance(routeTwo), routeTwo);
+
+        out.println(message);
+    }
+}