Skip to main content
Ctrl+K
NetworkX 3.4rc0.dev0 documentation - Home
  • 安装
  • 教程
  • Reference
  • Gallery
  • Developer
  • 发布版本
  • Guides
  • Home Page
  • GitHub
  • 安装
  • 教程
  • Reference
  • Gallery
  • Developer
  • 发布版本
  • Guides
  • Home Page
  • GitHub

Section Navigation

  • 引言
  • Graph types
  • Algorithms
  • Functions
    • degree
    • degree_histogram
    • density
    • create_empty_copy
    • is_directed
    • to_directed
    • to_undirected
    • is_empty
    • add_star
    • add_path
    • add_cycle
    • subgraph
    • induced_subgraph
    • restricted_view
    • edge_subgraph
    • nodes
    • number_of_nodes
    • neighbors
    • all_neighbors
    • non_neighbors
    • common_neighbors
    • edges
    • number_of_edges
    • density
    • non_edges
    • selfloop_edges
    • number_of_selfloops
    • nodes_with_selfloops
    • is_weighted
    • is_negatively_weighted
    • set_node_attributes
    • get_node_attributes
    • set_edge_attributes
    • get_edge_attributes
    • is_path
    • path_weight
    • freeze
    • is_frozen
  • Graph generators
  • Linear algebra
  • Converting to and from other data formats
  • Relabeling nodes
  • Reading and writing graphs
  • Drawing
  • 随机性
  • Exceptions
  • Utilities
  • 后端和配置
  • 术语表
  • Reference
  • Functions
  • number_of_edges

number_of_edges#

number_of_edges(G)[source]#

返回图中边的数量。

此函数封装了 G.number_of_edges 函数。

On this page
  • number_of_edges()

© Copyright 2004-2024, NetworkX Developers.

Created using Sphinx 7.4.7.

Built with the PyData Sphinx Theme 0.15.4.

优云智算