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.