Chinese programmer explains Graph Engineering
Most people heard the claim that loops are obsolete and stopped analyzing the topic entirely. A Chinese programmer just presented an explanation of Graph Engineering in a fifteen-minute video to challenge that silence. The progression from prompt to graph is accumulation, not replacement. A loop is one agent cycling until stop; a graph is many specialized loops with routing and shared state. It's crucial to distinguish this from knowledge graph or Graph RAG, execution graph vs data relationships vs retrieval. One node does the work, another watches it, that's the whole move. I converted the content of the fifteen-minute video into a full build using Kimi K3. The original video title is From Loops to Graphs. Bookmark this before you scroll past.
