Update README.md

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 
-- Dijkstra's Algorithm
+- [Breadth-first search](src/main/java/algorithm/BreadthFirstSearch.java) 
+- [Dijkstra's Algorithm](src/main/java/algorithm/DijkstrasAlgorithm.java)
 
 ## Technical specifications
 

src/main/java/Main.java

@@ -1,12 +1,12 @@
-import algorithm.Dijkstras;
+import algorithm.DijkstrasAlgorithm;
 import algorithm.Graph;
 
 import java.util.Map;
 
 public class Main {
     public static void main(String[] args) {
         System.out.println("Hello!");
-        var algorithm = new Dijkstras<String>();
+        var algorithm = new DijkstrasAlgorithm<String>();
 
         var graph = new Graph<>(Map.of(
                 "A", Map.of("B", 5),

src/main/java/algorithm/Dijkstras.java renamed to src/main/java/algorithm/DijkstrasAlgorithm.java

@@ -7,7 +7,7 @@
 import java.util.Objects;
 import java.util.stream.Stream;
 
-public class Dijkstras<T> implements SearchAlgorithm<T> {
+public class DijkstrasAlgorithm<T> implements SearchAlgorithm<T> {
 
     @Override
     public List<T> findPath(Graph<T> graph, T source, T target) {

src/test/groovy/algorithm/DijkstrasSpec.groovy renamed to src/test/groovy/algorithm/DijkstrasAlgorithmSpec.groovy

@@ -4,9 +4,9 @@ import spock.lang.Specification
 import spock.lang.Subject
 import spock.lang.Unroll
 
-class DijkstrasSpec extends Specification {
+class DijkstrasAlgorithmSpec extends Specification {
     @Subject
-    def algorithm = new Dijkstras<String>()
+    def algorithm = new DijkstrasAlgorithm<String>()
 
     @Unroll("from #source to #target the time is #time and the path is #fastest")
     def 'should find a route for a simple graph'() {