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.