tree_paths: All paths through a single tree from a random forest
In brfitzpatrick/forestviews: Visualise the paths through random forests

tree_paths is a low level function called by rf_all_paths to find all paths from root to leaf nodes through a single tree extracted from a random forest.

1
2
3

tree_paths(rf, tree, plot.network = FALSE, plot.vert.size = 0,
  label.vert.with.name = TRUE, circular.layout = TRUE,
  vertex.label.size = 0.75, arrow.size = 0.25)

`rf`	an object of class `randomForest` returned by `randomForest`
`tree`	a number indexing the tree constituent to `rf` which will be extracted and converted to an `igraph` network
`plot.network`	if `TRUE` the network is plotted. If `FALSE` the network is not plotted
`plot.vert.size`	a number setting the size of the circles which represent the nodes in the plot of the network
`label.vert.with.name`	if `TRUE` each vertex (node) is labeled with the covariate that defined the binary partition represented by that vertex. If `FALSE` each vertex is labeled with the name assigned to it by `igraph`
`circular.layout`	if `TRUE` the network is plotted with the circular layout from the igraph package. If `FALSE` the network is plotted with the default layout from the `igraph` package
`vertex.label.size`	a number controlling the size of the text used for the vertex labels in the plot
`edge.arrow.size`	a number controlling the size of arrows that represent the graph edges in the plot