... | ... |
@@ -21,12 +21,14 @@ tree as data.frame with equal angle layout. |
21 | 21 |
} |
22 | 22 |
\references{ |
23 | 23 |
The following aglorithm aims to implement the vague description of the "Equal-daylight Algorithm" |
24 |
-in "Inferring Phylogenies" pp 582-584 by Joseph Felsenstein.\preformatted{Leafs are subtrees with no children |
|
24 |
+in "Inferring Phylogenies" pp 582-584 by Joseph Felsenstein. |
|
25 |
+ |
|
26 |
+\if{html}{\out{<div class="sourceCode">}}\preformatted{Leafs are subtrees with no children |
|
25 | 27 |
Initialise tree using equal angle algorithm |
26 | 28 |
tree_df = equal_angle(tree) |
27 | 29 |
|
28 | 30 |
nodes = get list of nodes in tree_df breadth-first |
29 | 31 |
nodes = remove tip nodes. |
30 | 32 |
|
31 |
-} |
|
33 |
+}\if{html}{\out{</div>}} |
|
32 | 34 |
} |
... | ... |
@@ -21,15 +21,12 @@ tree as data.frame with equal angle layout. |
21 | 21 |
} |
22 | 22 |
\references{ |
23 | 23 |
The following aglorithm aims to implement the vague description of the "Equal-daylight Algorithm" |
24 |
-in "Inferring Phylogenies" pp 582-584 by Joseph Felsenstein. |
|
25 |
- |
|
26 |
-``` |
|
27 |
-Leafs are subtrees with no children |
|
24 |
+in "Inferring Phylogenies" pp 582-584 by Joseph Felsenstein.\preformatted{Leafs are subtrees with no children |
|
28 | 25 |
Initialise tree using equal angle algorithm |
29 | 26 |
tree_df = equal_angle(tree) |
30 | 27 |
|
31 | 28 |
nodes = get list of nodes in tree_df breadth-first |
32 | 29 |
nodes = remove tip nodes. |
33 | 30 |
|
34 |
-``` |
|
31 |
+} |
|
35 | 32 |
} |
... | ... |
@@ -4,12 +4,14 @@ |
4 | 4 |
\alias{layoutDaylight} |
5 | 5 |
\title{Equal daylight layout method for unrooted trees.} |
6 | 6 |
\usage{ |
7 |
-layoutDaylight(model, branch.length) |
|
7 |
+layoutDaylight(model, branch.length, MAX_COUNT = 5) |
|
8 | 8 |
} |
9 | 9 |
\arguments{ |
10 | 10 |
\item{model}{tree object, e.g. phylo or treedata} |
11 | 11 |
|
12 | 12 |
\item{branch.length}{set to 'none' for edge length of 1. Otherwise the phylogenetic tree edge length is used.} |
13 |
+ |
|
14 |
+\item{MAX_COUNT}{the maximum number of iterations to run (default 5)} |
|
13 | 15 |
} |
14 | 16 |
\value{ |
15 | 17 |
tree as data.frame with equal angle layout. |
... | ... |
@@ -4,10 +4,10 @@ |
4 | 4 |
\alias{layoutDaylight} |
5 | 5 |
\title{Equal daylight layout method for unrooted trees.} |
6 | 6 |
\usage{ |
7 |
-layoutDaylight(tree, branch.length) |
|
7 |
+layoutDaylight(model, branch.length) |
|
8 | 8 |
} |
9 | 9 |
\arguments{ |
10 |
-\item{tree}{phylo object} |
|
10 |
+\item{model}{tree object, e.g. phylo or treedata} |
|
11 | 11 |
|
12 | 12 |
\item{branch.length}{set to 'none' for edge length of 1. Otherwise the phylogenetic tree edge length is used.} |
13 | 13 |
} |
git-svn-id: file:///home/git/hedgehog.fhcrc.org/bioconductor/trunk/madman/Rpacks/ggtree@128515 bc3139a8-67e5-0310-9ffc-ced21a209358
1 | 1 |
new file mode 100644 |
... | ... |
@@ -0,0 +1,34 @@ |
1 |
+% Generated by roxygen2: do not edit by hand |
|
2 |
+% Please edit documentation in R/tidytree.R |
|
3 |
+\name{layoutDaylight} |
|
4 |
+\alias{layoutDaylight} |
|
5 |
+\title{Equal daylight layout method for unrooted trees.} |
|
6 |
+\usage{ |
|
7 |
+layoutDaylight(tree, branch.length) |
|
8 |
+} |
|
9 |
+\arguments{ |
|
10 |
+\item{tree}{phylo object} |
|
11 |
+ |
|
12 |
+\item{branch.length}{set to 'none' for edge length of 1. Otherwise the phylogenetic tree edge length is used.} |
|
13 |
+} |
|
14 |
+\value{ |
|
15 |
+tree as data.frame with equal angle layout. |
|
16 |
+} |
|
17 |
+\description{ |
|
18 |
+#' @title |
|
19 |
+} |
|
20 |
+\references{ |
|
21 |
+The following aglorithm aims to implement the vague description of the "Equal-daylight Algorithm" |
|
22 |
+in "Inferring Phylogenies" pp 582-584 by Joseph Felsenstein. |
|
23 |
+ |
|
24 |
+``` |
|
25 |
+Leafs are subtrees with no children |
|
26 |
+Initialise tree using equal angle algorithm |
|
27 |
+tree_df = equal_angle(tree) |
|
28 |
+ |
|
29 |
+nodes = get list of nodes in tree_df breadth-first |
|
30 |
+nodes = remove tip nodes. |
|
31 |
+ |
|
32 |
+``` |
|
33 |
+} |
|
34 |
+ |