Skip to content

Commit 2dfc351

Browse files
authored
Update README.md
1 parent 0f3c8f6 commit 2dfc351

File tree

1 file changed

+1
-1
lines changed

1 file changed

+1
-1
lines changed

bonus-assignment/README.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -15,7 +15,7 @@ The output of the project describes the number of points that the
1515
MST (minimum-spanning tree) consists of, the length of the MST
1616
( the sum of distances of all the connections used in the MST)
1717
and finally the connections of the points that are used to construct
18-
the MST.
18+
the MST. Full description is found [here](https://github.com/stef4k/Algorithms-and-data-structures-assignments2019/blob/main/bonus-assignment/ravi1996.pdf)
1919

2020
### Importance
2121
The finding of MST can be quite important in various cases. Firstly,

0 commit comments

Comments
 (0)