Fixed gradle files

Author: Jegors Cemisovs

.idea/gradle.xml

@@ -3,7 +3,6 @@ plugins {
     id 'java-library'
     id 'maven-publish'
 }
-sourceCompatibility = JavaVersion.VERSION_17
 
 group 'lv.id.jc'
 version '1.1'

algorithm/build.gradle

@@ -1,8 +1,3 @@
-/**
- * The module contains an interface for a graph and an interface for a graph search algorithm.
- * There is an implementation of two search algorithms:
- * Dijkstra's algorithm and Breadth First Search algorithm.
- */
 module lv.id.jc.algorithm.graph {
     exports lv.id.jc.algorithm.graph;
 }

algorithm/src/main/java/module-info.java

@@ -0,0 +1,13 @@
+plugins {
+    id 'application'
+}
+
+dependencies {
+    implementation project(':algorithm')
+}
+
+application {
+    mainModule = 'lv.id.jc.application'
+    mainClass = 'lv.id.jc.application.GraphApp'
+    applicationDefaultJvmArgs = ['-Dgreeting.language=en']
+}

application/build.gradle

@@ -1,4 +1,4 @@
-package lv.id.jc.sample;
+package lv.id.jc.application;
 
 import lv.id.jc.algorithm.graph.BreadthFirstSearch;
 import lv.id.jc.algorithm.graph.DijkstrasAlgorithm;
@@ -7,10 +7,8 @@
 
 import java.util.Map;
 
-import static java.lang.System.*;
-
 public class GraphApp {
-    private static final Graph<Character> COMPLEX_GRAPH = Graph.of(Map.of(
+    private static final Graph<Character> 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),
@@ -24,19 +22,16 @@ public class GraphApp {
     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');
+        printRoute('D', 'C');
+        printRoute('A', 'G');
+        printRoute('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 = """
+    @SuppressWarnings("squid:S106")
+    private static void printRoute(Character source, Character target) {
+        var routeOne = shortest.findPath(graph, source, target);
+        var routeTwo = fastest.findPath(graph, source, target);
+        var message = """
                         
                 Find the path from %s to %s
                     - the shortest take %.0f min and the path is %s
@@ -46,6 +41,6 @@ private static void printRoute(final Graph<Character> graph,
                         graph.getDistance(routeOne), routeOne,
                         graph.getDistance(routeTwo), routeTwo);
 
-        out.println(message);
+        System.out.println(message);
     }
 }

sample/src/main/java/lv/id/jc/sample/GraphApp.java renamed to application/src/main/java/lv/id/jc/application/GraphApp.java

@@ -0,0 +1,4 @@
+module lv.id.jc.application {
+    requires lv.id.jc.algorithm.graph;
+    exports lv.id.jc.application;
+}

application/src/main/java/module-info.java

@@ -1,4 +1,2 @@
-rootProject.name = 'algorithms'
-include 'algorithm'
-include 'sample'
-
+rootProject.name = 'graphs-algorithms'
+include 'algorithm', 'application'