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: bonus-assignment/README.md
+1-1Lines changed: 1 addition & 1 deletion
Display the source diff
Display the rich diff
Original file line number
Diff line number
Diff line change
@@ -15,7 +15,7 @@ The output of the project describes the number of points that the
15
15
MST (minimum-spanning tree) consists of, the length of the MST
16
16
( the sum of distances of all the connections used in the MST)
17
17
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)
19
19
20
20
### Importance
21
21
The finding of MST can be quite important in various cases. Firstly,
0 commit comments