get_nlargest_biconcomps

Returns a list of up to n largest biconnected components.

sasviya.network.algorithms.biconnected_components.get_nlargest_biconcomps(g, n, order_by='node', *, data=True, ascending=False)

These are the components that have the highest number of nodes or edges of a graph. When ties occur, the component that has the lower biconcomp_id value is returned.

Parameters

g : SAS graph object

Specifies the input graph.

n : int

Specifies the number of graphs to return.

order_by : ‘node’ or ‘edge’ or None

Specifies whether to sort the biconnected components by the number of nodes or edges within those components. The default is None, which means that the biconnected components are not sorted.

data : bool, optional

Specifies whether or not to retain attributes. The default is True, which means that the node and edge attributes of the graph are retained.

ascending : bool

Specifies whether to sort in ascending or descending order, when you specify the order_by parameter. When the value is True, the smallest biconnected components are returned instead. The default is False.

Returns

list

Returns a list of n largest or smallest biconnected components of a graph.

Last updated: July 28, 2026