spanning_tree: Minimum or Maximum Spanning Tree

In cograph: Analysis and Visualization of Complex Networks

Minimum or Maximum Spanning Tree

Description

Prim's algorithm on each connected component, so a disconnected network yields a spanning forest.

Usage

spanning_tree(
  x,
  weights = c("weight", "none"),
  maximum = FALSE,
  keep_format = FALSE,
  directed = NULL
)

Arguments

x	Network input.
weights	"weight" (default) uses the edge weights as costs; "none" treats every edge as cost 1.
maximum	Logical. Find the maximum spanning tree instead of the minimum. Default FALSE. Set TRUE when the weights are similarities.
keep_format	Logical. Return the input format when TRUE.
directed	Logical or NULL. Directedness to read the input with; the tree itself is undirected.

Value

An undirected cograph_network holding the spanning tree (or forest), or the input format when keep_format = TRUE. Every node is kept.

References

Prim, R. C. (1957). Shortest connection networks and some generalizations. Bell System Technical Journal, 36(6), 1389–1401.

See Also

disparity_filter, threshold_edges

Examples

adj <- matrix(c(0, .5, .8, 0,
                .5, 0, .3, .6,
                .8, .3, 0, .4,
                 0, .6, .4, 0), 4, 4, byrow = TRUE)
rownames(adj) <- colnames(adj) <- c("A", "B", "C", "D")

spanning_tree(adj)
spanning_tree(adj, maximum = TRUE)

cograph documentation built on Sept. 30, 2026, 5:08 p.m.