DOCUMENTATION
  • Software
    • Software
    • SAS Viya
    • Industries
    • Solutions
    • Products
  • Learn
    • Learn
    • Training
    • Certification
    • Academics
    • Books
    • Video Tutorials
  • Support
    • Support
    • Communities
    • Documentation
    • Developers
    • Support & Services
    • User Groups
  • About Us
    • About Us
    • Why SAS?
    • Company
    • Careers
    • Newsroom
    • Events
    • Contact Us
  • Explore
    • Explore
    • Try & Buy
    • Why SAS?
    • Customer Stories
    • Partners
    • Consulting
  • Software
  • SAS Viya
  • Industries
  • Solutions
  • Products
  • Learn
  • Training
  • Certification
  • Academics
  • Books
  • Video Tutorials
  • Support
  • Communities
  • Documentation
  • Developers
  • Support & Services
  • User Groups
  • About Us
  • Why SAS?
  • Company
  • Careers
  • Newsroom
  • Events
  • Contact Us
  • Explore
  • Try & Buy
  • Why SAS?
  • Customer Stories
  • Partners
  • Consulting
  • Contact Us
Sign In

Create Profile

My SAS

Get access to My SAS, trials, communities and more.

SAS Sites

sas.com
Support
Blogs
Communities
Developer
Curiosity
Videos

Documentation

Learn
Brand
PartnerNet
Merchandise
SAS® Help Center
SAS® Viya® Platform: Network Python API Guide
2026.06
|PDF 
Feedback
 
  • Biconnected Component Algorithms
    • articulation_points
    • biconcomp_distribution_edges
    • biconcomp_distribution_nodes
    • biconcomp_size_edges
    • biconcomp_size_nodes
    • biconnected_components
    • block_cut_tree
    • get_nlargest_biconcomps
    • is_biconnected
  • Centrality Algorithms
  • Clique Algorithms
  • Community Algorithms
  • Connected Component Algorithms
  • Core Algorithms
  • Cycle Algorithms
  • Flow Algorithms
  • Matching Algorithms
  • Minimum Cut Algorithms
  • Node Similarity Algorithms
  • Path Algorithms
  • Projection Algorithms
  • Query Algorithms
  • Reach Algorithms
  • Routing Algorithms
  • Shortest Path Algorithms
  • Spanning Tree Algorithms
  • Summary Algorithms
  • Topological Sort Algorithms
  • Traveling Salesman Algorithms
  • Mutable Graph Classes
  • Immutable Graph Classes
  • Output Graph Classes
  • Built-In Graph Utilities
  • Conversion Utilities
  • Preprocessing Utilities
  • Random Attribute Generator Utilities
  • Visualization Utilities
  • Utilities
  • Examples
 

biconcomp_size_nodes

Computes the number of nodes within each biconnected component.

sasviya.network.algorithms.biconnected_components.biconcomp_size_nodes(g)

Note that articulation points occur within more than one biconnected component.

  • Parameters
  • Returns

Parameters

g : SAS graph object

Specifies the undirected input graph to assess.

Returns

dict

Returns a dictionary in which the keys are biconnected component IDs and the values are the number of nodes within each component.

Last updated: July 28, 2026
Privacy Statement Terms of Use 
Copyright © SAS Institute Inc. All Rights Reserved