3 Title: Compute distances based on the nearest-neighbors graph.
6 Author: Benjamin Auder <benjamin.auder@universite-paris-saclay.fr> [aut,cre]
7 Maintainer: Benjamin Auder <benjamin.auder@universite-paris-saclay.fr>
8 Description: Only two functions for now. nng() builds the nearest-neighbors graph,
9 and ectd() computes the Euclidian Commute-Time Distances.
10 Only undirected graph case implemented so far.
11 License: MIT + file LICENSE
12 Imports: Rcpp, RcppEigen, igraph, pracma
13 LinkingTo: Rcpp, RcppEigen