MST.Construction {HGC} | R Documentation

## Building Unweighted Minimum Spanning Tree Graph

### Description

This function builds an Unweighted Minimum Spanning Tree (MST) graph in the input feature space using Euclidean distance metric.

### Usage

    MST.Construction(mat)

### Arguments

`mat` | the input data saved as a numerical matrix. The columns are the features and the rows are the samples.

### Details

This function builds a MST graph of the input data. The main function come from the R package `ape`.

### Value

An n by n binary dgCMatrix object C, where n is the number of input samples. The matrix C is the adjacency matrix of the built MST graph. C[i,j] = 1 means that there is an edge between sample i and sample j.

### Examples

    data(Pollen)
    Pollen.PCs <- Pollen[["PCs"]]
    G <- MST.Construction(Pollen.PCs)

[Package HGC version 1.2.0 Index]