Skip to content

Commit 5e88170

Browse files
author
Jegors Čemisovs
committed
Updated README.md
1 parent 87dd1fa commit 5e88170

File tree

4 files changed

+5
-5
lines changed

4 files changed

+5
-5
lines changed

docs/README.md README.md

+5-5
Original file line numberDiff line numberDiff line change
@@ -15,7 +15,7 @@ can also see the [specifications](https://algorithms.jc.id.lv/docs/spock-reports
1515
The first step is to create a graph structure. The Graph interface is generic, so you can use any Java type for vertex
1616
and any [Number](https://docs.oracle.com/en/java/javase/17/docs/api/java.base/java/lang/Number.html) type for distance.
1717

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.
1919

2020
[![asciicast](https://asciinema.org/a/468058.svg)](https://asciinema.org/a/468058)
2121

@@ -26,7 +26,7 @@ utilized to find the optimal route in the metro schema.
2626

2727

2828
### 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).
3030

3131
```java
3232
var graph = Graph.of(Map.of(
@@ -83,7 +83,7 @@ Tests are written in Groove language. For unit testing, the [Spock Framework](ht
8383
])
8484
```
8585

86-
![Small Graph](assets/small.gif)
86+
![Small Graph](docs/assets/small.gif)
8787

8888

8989
### Medium Graph Sample
@@ -98,7 +98,7 @@ Tests are written in Groove language. For unit testing, the [Spock Framework](ht
9898
])
9999
```
100100

101-
![Medium Graph](assets/medium.gif)
101+
![Medium Graph](docs/assets/medium.gif)
102102

103103
### Complex Graph Sample
104104

@@ -115,5 +115,5 @@ Tests are written in Groove language. For unit testing, the [Spock Framework](ht
115115
])
116116
```
117117

118-
![Complex Graph](assets/complex.gif)
118+
![Complex Graph](docs/assets/complex.gif)
119119

docs/_config.yml _config.yml

File renamed without changes.
File renamed without changes.
File renamed without changes.

0 commit comments

Comments
 (0)