Yes, I have implemented HITL. There's a task queue(psql skiplock). You make a request (insert row). It builds a "workflow graph" of your request and compiles it, a combination between a FSM and graph program. It runs an iteration on the workgraph, and then if successful, submits the next step in the queue as "pending". the user then inspects and accepts the tasks, which then run another iteration of the workgraph. If the user rejects it they can click "playground" and manually do the step.
Comments
Yes, I have implemented HITL. There's a task queue(psql skiplock). You make a request (insert row). It builds a "workflow graph" of your request and compiles it, a combination between a FSM and graph program. It runs an iteration on the workgraph, and then if successful, submits the next step in the queue as "pending". the user then inspects and accepts the tasks, which then run another iteration of the workgraph. If the user rejects it they can click "playground" and manually do the step.
is the "workflow graph" entirely custom built or is there a library/framework/service for it? Would love to hear more
sorry I meant to say or explain computational graph, and yes langgraph was reintroduced recently last week.