GraphOfThought

Mechanism

The canonical implementation of graph-structured reasoning. Instantiates the Think primitive with a DAG topology so that inference steps can have multiple predecessors and multiple successors — nodes that converge from different reasoning branches can unify mid-computation without forcing a tree shape. Complements ChainOfThought (linear), TreeOfThoughts (branching without merge), and SkeletonOfThought (outline-parallel expansion). Used when distinct lines of reasoning should feed into shared intermediate conclusions — common in proof assistants, complex debugging, and multi-hypothesis analysis where evidence from branch A refines node X shared with branch B.