Unverified50% confidenceFactExact time
A graph structure consists of three core elements—nodes, edges, and state—where nodes are the smallest execution units, edges are the transition logic between nodes, and state is the data carrier shared across the entire graph.
1
Sources
50%
Confidence
Long-term
Relevance
10/2/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedNodes are the smallest constituent units of a workflow, encompassing types such as LLM calls, conditional logic, knowledge retrieval, code execution, and variable processing.65% similarUnverifiedA dominating set is a subset of nodes in a graph such that every node either belongs to the set or is adjacent to some node in the set.64% similarUnverified列表操作节点可以链式叠加，一个节点的数组输出可作为下一个列表操作节点的输入64% similarUnverifiedER diagrams describe the logical structure of data through three core elements: Entity, Attribute, and Relationship.61% similarUnverified无索引邻接（Index-Free Adjacency）架构使每个节点直接持有指向相邻节点的物理内存指针，查询遍历时间复杂度为O(1)60% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/967710API
curl https://kongchang.com/api/v1/knowledge/claims/967710MCP
get_claim(id=967710)