[nngd.git] / DESCRIPTION

Package: nngd
Type: Package
Title: Compute distances based on the nearest-neighbors graph.
Version: 1.0
Date: 2021-12-06
Author: Benjamin Auder <benjamin.auder@universite-paris-saclay.fr> [aut,cre]
Maintainer: Benjamin Auder <benjamin.auder@universite-paris-saclay.fr>
Description: Only two functions for now. nng() builds the nearest-neighbors graph,
             and ectd() computes the Euclidian Commute-Time Distances.
             Only undirected graph case implemented so far.
License: MIT + file LICENSE
Imports: Rcpp, RcppEigen, igraph, pracma
LinkingTo: Rcpp, RcppEigen
RoxygenNote: 7.1.2
Commit	Line	Data
762721a5 BA	1	Package: nngd
	2	Type: Package
	3	Title: Compute distances based on the nearest-neighbors graph.
	4	Version: 1.0
	5	Date: 2021-12-06
	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
	14	RoxygenNote: 7.1.2