motif op• 数据种类:matrix → table
• 调用: import fullseye as fs; fs.ledger.graph_cycle3(adj)(要直接调用实现,import graphinv; graphinv.graph_cycle3(adj);从台账取用则 opsgraph.get("graph_cycle3"))
> 该算子的说明尚无译文,以下照原文给出。
Number of directed 3-cycles i -> j -> k -> i as tr(B^3) / 3.
Each cycle is counted once (the trace visits it from each of its three starting nodes). Self-loops are removed first. Returns a dict with cycles3 and n.
A second, independent implementation (brute-force enumeration) agrees exactly on small graphs — pinned in the tests, because a single implementation of a counting formula cannot catch its own off-by-three.
Raises ValueError: as graph_degree_summary.
• 示例数据目录(下载 URL / 许可证) —— 2-D 用 skimage.data(BSD/公有领域)加合成图,3-D 给出真实数据源(Stanford/PDS 等)的下载 URL。
• 算子来历与参考文献 —— 该算子族所依据的研究/方法出处。
• 算法的正典(作者、年份)与用途见上面的族使用指南。
• graphinv_three_phyla — py -3.11 examples/graphinv_three_phyla.py
table 作为输入)graph_edge_consensus · graph_core_persistence · tree_morphometry · tree_sholl · tree_run_length
motif)—
*Provenance: graphinv.py — GRAPH 算子登记表。本条目由 tools/opdocs.py md 自动生成(请勿手工编辑)。*
© 2026 Kazufumi Furuse — Fullseye operator documentation. Licensed under Apache-2.0.