Refactoring packages

Author: rabestro

README.md

@@ -2,8 +2,8 @@
 
 This project was created to test graph search algorithms. There are implementations and tests for two algorithms:
 
-- [Breadth-first search](src/main/java/algorithm/BreadthFirstSearch.java) 
-- [Dijkstra's Algorithm](src/main/java/algorithm/DijkstrasAlgorithm.java)
+- [Breadth-first search](src/main/java/graph/BreadthFirstSearch.java) 
+- [Dijkstra's Algorithm](src/main/java/graph/DijkstrasAlgorithm.java)
 
 ## Technical specifications
 

src/main/groovy/lv/id/jc/AppGroovy.groovy

@@ -0,0 +1,49 @@
+package lv.id.jc;
+
+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;
+
+public class AppExample {
+    private static final Graph<Character> COMPLEX_GRAPH = new Graph<>(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) {
+        System.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);
+
+        System.out.println(message);
+    }
+}

src/main/java/lv/id/jc/AppExample.java

@@ -1,4 +1,4 @@
-package algorithm;
+package lv.id.jc.algorithm.graph;
 
 import java.util.HashMap;
 import java.util.HashSet;

src/main/java/lv/id/jc/AppJava.java

@@ -1,4 +1,4 @@
-package algorithm;
+package lv.id.jc.algorithm.graph;
 
 import java.util.HashMap;
 import java.util.LinkedList;

src/main/java/algorithm/BreadthFirstSearch.java renamed to src/main/java/lv/id/jc/algorithm/graph/BreadthFirstSearch.java

@@ -1,4 +1,4 @@
-package algorithm;
+package lv.id.jc.algorithm.graph;
 
 import java.util.List;
 import java.util.Map;

src/main/java/algorithm/DijkstrasAlgorithm.java renamed to src/main/java/lv/id/jc/algorithm/graph/DijkstrasAlgorithm.java

@@ -1,4 +1,4 @@
-package algorithm;
+package lv.id.jc.algorithm.graph;
 
 import java.util.List;
 

src/main/java/algorithm/Graph.java renamed to src/main/java/lv/id/jc/algorithm/graph/Graph.java

@@ -1,5 +1,7 @@
-package algorithm
+package graph
 
+import lv.id.jc.algorithm.graph.BreadthFirstSearch
+import lv.id.jc.algorithm.graph.Graph
 import spock.lang.Specification
 import spock.lang.Subject
 

src/main/java/algorithm/SearchAlgorithm.java renamed to src/main/java/lv/id/jc/algorithm/graph/SearchAlgorithm.java

@@ -1,5 +1,7 @@
-package algorithm
+package graph
 
+import lv.id.jc.algorithm.graph.DijkstrasAlgorithm
+import lv.id.jc.algorithm.graph.Graph
 import spock.lang.Specification
 import spock.lang.Subject