Skip to main content
Ctrl+K
NetworkX 3.5rc0.dev0 documentation - Home NetworkX 3.5rc0.dev0 documentation - Home
  • Install
  • Tutorial
  • Backends
  • Reference
  • Gallery
  • Developer
  • Releases
    • Guides
  • Home Page
  • GitHub
  • Install
  • Tutorial
  • Backends
  • Reference
  • Gallery
  • Developer
  • Releases
  • Guides
  • Home Page
  • GitHub

Section Navigation

  • Introduction
  • Graph types
  • Algorithms
    • Approximations and Heuristics
    • Assortativity
    • Asteroidal
    • Bipartite
    • Boundary
    • Bridges
    • Broadcasting
    • Centrality
    • Chains
    • Chordal
    • Clique
    • Clustering
    • Coloring
    • Communicability
    • Communities
    • Components
    • Connectivity
    • Cores
    • Covering
    • Cycles
    • Cuts
    • D-Separation
    • Directed Acyclic Graphs
    • Distance Measures
    • Distance-Regular Graphs
    • Dominance
    • Dominating Sets
    • Efficiency
    • Eulerian
    • Flows
    • Graph Hashing
    • Graphical degree sequence
    • Hierarchy
    • Hybrid
    • Isolates
    • Isomorphism
    • Link Analysis
    • Link Prediction
    • Lowest Common Ancestor
    • Matching
    • Minors
    • Maximal independent set
    • non-randomness
    • Moral
    • Node Classification
    • Operators
    • Planarity
    • Planar Drawing
    • Graph Polynomials
    • Reciprocity
    • Regular
    • Rich Club
    • Shortest Paths
    • Similarity Measures
    • Simple Paths
    • Small-world
    • s metric
    • Sparsifiers
    • Structural holes
    • Summarization
    • Swap
    • Threshold Graphs
    • Time dependent
    • Tournament
    • Traversal
    • Tree
    • Triads
    • Vitality
    • Voronoi cells
    • Walks
    • Wiener Index
  • Functions
  • Graph generators
  • Linear algebra
  • Converting to and from other data formats
  • Relabeling nodes
  • Reading and writing graphs
  • Drawing
  • Randomness
  • Exceptions
  • Utilities
  • Backends
  • Configs
  • Glossary
  • Reference
  • Algorithms
  • s metric

s metric#

s_metric(G)

Returns the s-metric [R4ac31df7a658-1] of graph.

© Copyright 2004-2024, NetworkX Developers.

Created using Sphinx 8.1.3.

Built with the PyData Sphinx Theme 0.16.1.