population op• 数据种类:table → table
• 调用: import fullseye as fs; fs.ledger.graph_core_persistence(adjs, mode='in', weighted=False)(要直接调用实现,import graphinv; graphinv.graph_core_persistence(adjs, mode='in', weighted=False);从台账取用则 opsgraph.get("graph_core_persistence"))
> 该算子的说明尚无译文,以下照原文给出。
Which nodes sit in the innermost core of every individual — K wirings on one node order.
`adjs is a list of K square matrices or a table {name: matrix}` on the same
node order (a node absent from an individual is a zero row and column). For each
individual the innermost core of :func:graph_kcore (same `mode / weighted`) is
taken; `appearances[v]` counts the individuals whose innermost core contains v.
Following Yadav & Singh 2026, a node is persistent if it is in the core of all K,
recurrent if in 2 .. K−1, transient if in exactly 1, and never otherwise.
Returns a dict: `k (K), n, names, membership` (K, n) bool,
`appearances (n,), persistent / recurrent / transient / never` (n,)
bool masks, `n_persistent .. n_never, kmax` (K,) the innermost index per
individual, `n_inner (K,), mode, weighted`.
Identities: `sum(n_inner) == sum(appearances)`; the four classes partition the
nodes; K identical inputs make every core node persistent and nothing recurrent or
transient; every persistent node is in every individual's innermost core.
Raises `ValueError: adjs` not a list / table; fewer than 2 individuals;
matrices of different sizes; any refusal of :func:graph_kcore.
• 示例数据目录(下载 URL / 许可证) —— 2-D 用 skimage.data(BSD/公有领域)加合成图,3-D 给出真实数据源(Stanford/PDS 等)的下载 URL。
• 算子来历与参考文献 —— 该算子族所依据的研究/方法出处。
• 算法的正典(作者・年份)与用途见上面的族使用指南。
• poc_worm_core_persists — py -3.11 examples/poc_worm_core_persists.py
table 作为输入)graph_edge_consensus · tree_morphometry · tree_sholl · tree_run_length
population)graph_edge_consensus · graph_strength_growth
*Provenance: graphinv.py — GRAPH 算子登记表。本条目由 tools/opdocs.py md 自动生成(请勿手工编辑)。*
© 2026 Kazufumi Furuse — Fullseye operator documentation. Licensed under Apache-2.0.