7 ms·
Pregel actually doesn't require the structure of the graph to be declared ahead of time, the next set of tasks (functions) to run is computed at the beginning o
by nfcampos 2y ago
Pregel actually doesn't require the structure of the graph to be declared ahead of time, the next set of tasks (functions) to run is computed at the beginning of each step, so in theory the graph topology could be entirely dynamic. Langgraph supports dynamic topologies too, ie. don't declare any hard edges, add a conditional edge after every node
- dbmikus 2y agoGood to know! Is there a succinct explanation of the value that pregel brings to LangGraph? Is it the 3 items I mentioned?
- nfcampos 2y agoThe value of using pregel is supporting cyclical graphs, with concurrent tasks, but completely deterministic behavior (eg. doesn't matter that task A this time happens to finish before task B, its results will be applied in a predetermined order, etc)
- dbmikus 2y agoMaking concurrent work deterministic and solving data races makes sense. Thanks for explaining! I didn't fully grok this from the LangGraph docs