graph.mincut: Minimum cut in a graph

In igraph/rigraph: Network Analysis and Visualization

Minimum cut in a graph

Description

graph.mincut() was renamed to min_cut() to create a more consistent API.

Usage

graph.mincut(
  graph,
  source = NULL,
  target = NULL,
  capacity = NULL,
  value.only = TRUE
)

Arguments

graph	The input graph.
source	The id of the source vertex.
target	The id of the target vertex (sometimes also called sink).
capacity	Vector giving the capacity of the edges. If this is NULL (the default) then the capacity edge attribute is used.
value.only	Logical scalar, if TRUE only the minimum cut value is returned, if FALSE the edges in the cut and a the two (or more) partitions are also returned.

igraph/rigraph documentation built on May 19, 2024, 6:19 a.m.