filter_nodes: Filter Nodes by Metadata or Centrality

In cograph: Analysis and Visualization of Complex Networks

Filter Nodes by Metadata or Centrality

Description

Filter nodes using dplyr-style expressions on any node column or centrality measure. Returns a cograph_network object by default (universal format), or optionally the same format as input when keep_format = TRUE.

Usage

filter_nodes(
  x,
  ...,
  .keep_edges = c("internal", "none"),
  keep_format = FALSE,
  directed = NULL
)

subset_nodes(
  x,
  ...,
  .keep_edges = c("internal", "none"),
  keep_format = FALSE,
  directed = NULL
)

Arguments

x	Network input: cograph_network, matrix, igraph, network, or tna object.
...	Filter expressions using any node column or centrality measure. Available variables include: Node columns All columns in the nodes dataframe: id, label, name, x, y, inits, color, plus any custom Centrality measures degree, indegree, outdegree, strength, instrength, outstrength, betweenness, closeness, eigenvector, pagerank, hub, authority Examples: degree >= 3, label %in% c("A", "B"), pagerank > 0.1 & degree >= 2.
.keep_edges	How to handle edges. One of: "internal" (default) Keep only edges between remaining nodes "none" Remove all edges
keep_format	Logical. If TRUE, return the same format as input (matrix returns matrix, igraph returns igraph, etc.). Default FALSE returns cograph_network (universal format).
directed	Logical or NULL. If NULL (default), auto-detect from matrix symmetry. Set TRUE to force directed, FALSE to force undirected. Only used for non-cograph_network inputs.

Value

A cograph_network object with filtered nodes. If keep_format = TRUE, returns the same type as input (matrix, igraph, network, etc.).

See Also

filter_edges, splot, subset_nodes

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")

# Keep only high-degree nodes (returns cograph_network)
filter_nodes(adj, degree >= 3)

# Keep format: matrix in, matrix out
filter_nodes(adj, degree >= 3, keep_format = TRUE)

# Filter by node label
splot(filter_nodes(adj, label %in% c("A", "C")))

# Combine centrality and metadata filters
splot(filter_nodes(adj, degree >= 2 & label != "D"))

# With cograph_network (pipe-friendly)
net <- as_cograph(adj)
net |>
  filter_edges(weight > 0.3) |>
  filter_nodes(degree >= 2) |>
  splot()

# With igraph (keep_format = TRUE returns igraph)
if (requireNamespace("igraph", quietly = TRUE)) {
  g <- igraph::make_ring(5)
  filter_nodes(g, degree >= 2, keep_format = TRUE)  # Returns igraph
}

cograph documentation built on April 1, 2026, 1:07 a.m.