Update recipes/r-emstreer/meta.yaml
@@ -58,7 +58,7 @@ test:
about:
home: https://CRAN.R-project.org/package=emstreeR
- license: BSD_3_clause
+ license: BSD-3-Clause
summary: Fast and easily computes an Euclidean Minimum Spanning Tree (EMST) from data, relying
on the R API for 'mlpack' - the C++ Machine Learning Library (Curtin et. al., 2013).
'emstreeR' uses the Dual-Tree Boruvka (March, Ram, Gray, 2010, <doi:10.1145/1835804.1835882>),
