HGC

Fast hierarchical clustering for large-scale single-cell data. The core function of HGC takes a graph G as the input. Here G is the adjacency matrix of a graph of cells, where the element in G are the weights of edges in the graph, and zero means no link between the corresponding node pairs. G should be a dgCMatrix supported by the R package Matrix.