R: A list with labels for each subtree (edge)

partition_leaves {dendextend} | R Documentation

## A list with labels for each subtree (edge)

### Description

Returns the set of all bipartitions from all edges, that is: a list with the labels for each of the nodes in the dendrogram.

### Usage

    partition_leaves(dend, ...)

### Arguments

`dend` | a dendrogram
`...` | Ignored.

### Value

A list with the labels for each of the nodes in the dendrogram.

### Source

A dendrogram implementation for partition.leaves from the distory package

### See Also

distinct_edges, highlight_distinct_edges, dist.dendlist, tanglegram, partition.leaves

### Examples

    x <- 1:3 %>% dist %>% hclust %>% as.dendrogram
    plot(x)
    partition_leaves(x)

    ## Not run:
    set.seed(23235)
    ss <- sample(1:150, 10 )
    dend1 <- iris[ss,-5] %>% dist %>% hclust("com") %>% as.dendrogram
    dend2 <- iris[ss,-5] %>% dist %>% hclust("single") %>% as.dendrogram

    partition_leaves(dend1)
    partition_leaves(dend2)

    ## End(Not run)

[Package dendextend version 1.8.0 Index]