You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: README.md
+5-5
Original file line number
Diff line number
Diff line change
@@ -15,7 +15,7 @@ can also see the [specifications](https://algorithms.jc.id.lv/docs/spock-reports
15
15
The first step is to create a graph structure. The Graph interface is generic, so you can use any Java type for vertex
16
16
and any [Number](https://docs.oracle.com/en/java/javase/17/docs/api/java.base/java/lang/Number.html) type for distance.
17
17
18
-
To demonstrate the work of search algorithms, I made a small console program. The program allows you to select one of three graph samples and search for a path using two algorithms. The source code of the program is located in `graph-shell` module.
18
+
To demonstrate the work of search algorithms, I made a small console program '[Graph Shell](graph-shell/README.md)'. The program allows you to select one of three graph samples and search for a path using two algorithms. The source code of the program is located in `graph-shell` module.
@@ -26,7 +26,7 @@ utilized to find the optimal route in the metro schema.
26
26
27
27
28
28
### Example
29
-
In the following Java code we create a graph structure with eight nodes. We use [Character](https://docs.oracle.com/en/java/javase/17/docs/api/java.base/java/lang/Character.html) class for vertex identification and [Integer](https://docs.oracle.com/en/java/javase/17/docs/api/java.base/java/lang/Integer.html) for the distance. You can see the graphic representation of the scheme [here](assets/complex.gif).
29
+
In the following Java code we create a graph structure with eight nodes. We use [Character](https://docs.oracle.com/en/java/javase/17/docs/api/java.base/java/lang/Character.html) class for vertex identification and [Integer](https://docs.oracle.com/en/java/javase/17/docs/api/java.base/java/lang/Integer.html) for the distance. You can see the graphic representation of the scheme [here](docs/assets/complex.gif).
30
30
31
31
```java
32
32
var graph =Graph.of(Map.of(
@@ -83,7 +83,7 @@ Tests are written in Groove language. For unit testing, the [Spock Framework](ht
83
83
])
84
84
```
85
85
86
-

86
+

87
87
88
88
89
89
### Medium Graph Sample
@@ -98,7 +98,7 @@ Tests are written in Groove language. For unit testing, the [Spock Framework](ht
98
98
])
99
99
```
100
100
101
-

101
+

102
102
103
103
### Complex Graph Sample
104
104
@@ -115,5 +115,5 @@ Tests are written in Groove language. For unit testing, the [Spock Framework](ht
0 commit comments