member_components: Component partitioning algorithms

In manynet: Many Ways to Make, Modify, Mark, and Measure Myriad Networks

Component partitioning algorithms

Description

These functions create a vector of nodes' memberships in components:

• node_in_component() assigns nodes' component membership using edge direction where available.

• node_in_weak() assigns nodes' component membership ignoring edge direction.

• node_in_strong() assigns nodes' component membership based on edge direction.

In graph theory, components, sometimes called connected components, are induced subgraphs from partitioning the nodes into disjoint sets. All nodes that are members of the same partition as i are reachable from i.

For directed networks, strongly connected components consist of subgraphs where there are paths in each direction between member nodes. Weakly connected components consist of subgraphs where there is a path in either direction between member nodes.

Usage

node_in_component(.data)

node_in_weak(.data)

node_in_strong(.data)

Arguments

.data

An object of a manynet-consistent class: matrix (adjacency or incidence) from {base} R edgelist, a data frame from {base} R or tibble from {tibble} igraph, from the {igraph} package network, from the {network} package tbl_graph, from the {tidygraph} package

See Also

Other memberships: mark_core, member_brokerage, member_cliques, member_community_hier, member_community_non, member_equivalence

Examples

ison_monks %>% to_uniplex("esteem") %>%
  mutate_nodes(comp = node_in_component())

manynet documentation built on Nov. 5, 2025, 6:26 p.m.