Infrastructure · Data Structures
Topology
Interface for reasoning structures
Definition
Mechanism
A marker interface. A pattern implementing 'Topology' MUST declare the node-edge shape of the structure it describes — Linear, Tree, DAG, Cyclic and so on. The shape is the claim: it fixes what traversals and what orderings are possible, independent of what the nodes hold. Applies to any node-edge structure, not only to reasoning.
Invariants
None stated.
Risks
Failure modes
None stated.
Relationships
Root pattern: builds on nothing in this library.
Used by
References
Mind
Step-by-step reasoning (Macro for Think(Chain))
Recursive or iterative topology
Directed acyclic dependency graph
Society
Geometric neighbor consensus
Mind
Complexity justification via Occams Razor
Mind
Execute a cognitive topology
Parallel outline-first topology
Society
Active hierarchy of coordinated solver instances
Branching reasoning topology
Reference
Data schema
{
"type": "object",
"required": [
"shape"
],
"properties": {
"shape": {
"type": "string",
"enum": [
"Linear",
"Tree",
"DAG",
"Cyclic",
"Graph"
],
"description": "The structural pattern"
},
"nodes": {
"type": "array",
"description": "List of node definitions"
},
"edges": {
"type": "array",
"description": "List of edge definitions (connections)"
}
}
}