Commit 332a0cc4 authored by Guilherme Telles's avatar Guilherme Telles
Browse files

sources

parent becfd284
......@@ -21,11 +21,11 @@
\param n The number of OTUs.
\returns An undirected acyclic graph where the OTUs are the vertices labeled
from 0 to n-1 and hypothetical nodes are vertices labeled from n to
graph->n-1 (vertices that correspond to OTUs also have their flag field set
to 1), and the flag field in the graph is set to the number of live ancestors.
On failure it returns NULL and sets errno to ENOMEM.
\returns An undirected acyclic graph where OTUs are the vertices labeled from
0 to n-1, hypothetical nodes are vertices labeled from n to graph->n-1,
vertices that correspond to OTUs have their flag field set to 1, and
graph->flag is set to the number of live ancestors. On failure it returns
NULL and sets errno to ENOMEM.
**/
graph* lnj(double** D, int n) {
......
......@@ -23,8 +23,9 @@
\param n The number of OTUs.
\returns An undirected acyclic graph where OTUS are the vertices labeled from
0 to n-1, and hypothetical nodes are vertices labeled from n to 2n-3. On
failure it returns NULL and sets errno to ENOMEM.
0 to n-1, hypothetical nodes are vertices labeled from n to 2n-3 and leaves
have their flag field set to 1. On failure it returns NULL and sets errno to
ENOMEM.
**/
graph* nj_sn(double** D, int n) {
......
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment