graph_degree_summary — GRAPH degree op

• 数据种类:matrix → table

• 调用: import fullseye as fs; fs.ledger.graph_degree_summary(adj)(要直接调用实现,import graphinv; graphinv.graph_degree_summary(adj);从台账取用则 opsgraph.get("graph_degree_summary"))

用法

> 该算子的说明尚无译文,以下照原文给出。

Degrees, density and reciprocity of a directed wiring matrix.

`adj is a square matrix; entry (i, j) > 0 means an edge i -> j`. Self-loops

are counted separately and excluded from the edge statistics. Returns a dict with

`n, edges, self_loops, the in_degree / out_degree` arrays,

`density (edges / (n (n-1))), and reciprocal_pairs` (unordered pairs wired

in both directions).

The identity `in_degree.sum() == out_degree.sum() == edges` holds exactly for

any directed graph and is checked before returning (fail-closed — if it ever broke,

the matrix was not what the caller thought).

Raises `ValueError`: non-square / empty / non-finite / negative input, or a

matrix over the node cap.

参考(示例数据・文献)

• 示例数据目录(下载 URL / 许可证) —— 2-D 用 skimage.data(BSD/公有领域)加合成图,3-D 给出真实数据源(Stanford/PDS 等)的下载 URL。

• 算子来历与参考文献 —— 该算子族所依据的研究/方法出处。

• 算法的正典(作者・年份)与用途见上面的族使用指南。

可运行的示例(实际调用该算子并已验证的样例)

• graphinv_three_phyla — py -3.11 examples/graphinv_three_phyla.py

• poc_connectome_lr_symmetry — py -3.11 examples/poc_connectome_lr_symmetry.py

类型可衔接的下一个算子(可接受 table 作为输入)

graph_edge_consensus · graph_core_persistence · tree_morphometry · tree_sholl · tree_run_length

同类别(degree)

—

*Provenance: graphinv.py — GRAPH 算子登记表。本条目由 tools/opdocs.py md 自动生成(请勿手工编辑)。*

© 2026 Kazufumi Furuse — Fullseye operator documentation. Licensed under Apache-2.0.