Introduction
A Go-based framework has been developed to oversee the execution of workflows delineated by directed acyclic graphs (DAGs).
Last updated
A Go-based framework has been developed to oversee the execution of workflows delineated by directed acyclic graphs (DAGs).
Last updated
GO-DAG is a framework developed using the Go language. It is utilized to structure a sequence of subtasks into a directed acyclic graph based on their dependencies' order and oversee the execution process.
This project strictly adheres to zero external dependencies, relying solely on internal code packages (excluding testing requirements).
Currently, the released versions include:
Here is the execution graph:
After the completion of the t:input task, which dispatches its output to both c:transit1 and c:transit2 channels, the tasks t:t11 and t:t12 will commence simultaneously. They will then transmit their respective output results to the t:transit1 and t:transit2 channels. Subsequently, the t:output task will resume its execution solely upon receiving data from both c:t21 and c:t22 channels.
Go Package: https://pkg.go.dev/github.com/rhosocial/go-dag
To access specific usage instructions, please click on the table of contents located on the left side of the page.
