fullseye

graph_cycle3 — GRAPH motif op

使い方

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 :func:graph_degree_summary.

参考(サンプルデータ・文献)

実行できる例(この op を実際に呼ぶ検証済みサンプル)

型が繋がる次の op(table を入力に取れる)

graph_edge_consensus · graph_core_persistence · tree_morphometry · tree_sholl · tree_run_length

同カテゴリ(motif)

—


Provenance: graphinv.py — GRAPH operator registry. この per-op ノートは tools/opdocs.py md が自動生成(手編集しない)。

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