Skip to content

Commit b78dd97

Browse files
authored
Update index.md
1 parent c99ed58 commit b78dd97

File tree

1 file changed

+1
-1
lines changed

1 file changed

+1
-1
lines changed

docs/index.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -12,7 +12,7 @@ You can also see the [specifications](spock-reports) for the classes generated w
1212

1313
## How to use the classes in your program
1414

15-
The first step is create a graph structure. The [Graph](https://algorithms.jc.id.lv/api/lv.id.jc.algorithm/lv/id/jc/algorithm/graph/Graph.html) interface is generic, and you can use any Java type for vertex and any [Number](https://docs.oracle.com/en/java/javase/17/docs/api/java.base/java/lang/Number.html) type for distance.
15+
The first step is create a graph structure. The Graph interface is generic, and you can use any Java type for vertex and any [Number](https://docs.oracle.com/en/java/javase/17/docs/api/java.base/java/lang/Number.html) type for distance.
1616

1717
### Example
1818
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).

0 commit comments

Comments
 (0)