1.AhmadHassan-BTed / Jantt
The AI-native JSON Gantt chart engine. Dependency-free interactive timelines with React, script-tag, CLI, topological DAG solver, and formal JSON schema.
+1,723 stars
from 4,289 · score 7.45
Trending repositories
Ranked by Attention Score: stars gained over the last 7 complete days
11 repositories by Attention Score · Oct 27, 2026 – Nov 2, 2026 (UTC)
2.dagucloud / dagu
Self-hostable workflow orchestrator for teams whose main work isn't orchestration. Declarative YAML over your scripts, SSH commands, containers, etc; keep workflows separate from business logic. One binary, no database, runs on limited H/W resources. Alternative to Airflow / Cron / Job Scheduler.
+84 stars
from 4,443 · score 4.44
3.marimo-team / marimo
A reactive notebook for Python — run reproducible experiments, query with SQL, execute as a script, deploy as an app, and version with git. Stored as pure Python. All in a modern, AI-native editor.
+79 stars
from 23,318 · score 4.38
4.apache / airflow
Apache Airflow - A platform to programmatically author, schedule, and monitor workflows
+66 stars
from 47,277 · score 4.20
5.hatchet-dev / hatchet
🪓 An orchestration engine for background tasks, AI agents, and durable workflows
+29 stars
from 8,182 · score 3.40
6.argoproj / argo-workflows
Workflow Engine for Kubernetes
+25 stars
from 17,052 · score 3.26
7.apache / hamilton
Apache Hamilton helps data scientists and engineers define testable, modular, self-documenting dataflows, that encode lineage/tracing and metadata. Runs and scales everywhere python does.
+5 stars
from 2,617 · score 1.79
8.Qiskit / rustworkx
A high performance Python graph library implemented in Rust.
+4 stars
from 1,773 · score 1.61
9.ChunelFeng / CGraph
【A common used C++ & Python DAG framework】 一个通用的、无三方依赖的、跨平台的、收录于awesome-cpp的、基于流图的并行计算框架。欢迎star & fork & 交流
+3 stars
from 2,315 · score 1.39
10.sogou / workflow
C++ Parallel Computing and Asynchronous Networking Framework
+1 stars
from 14,424 · score 0.69
11.hmdsefi / gograph
Generic graph data structures and algorithms for Go (Golang): dependency graphs (DAGs) with cycle checks and topological sort, BFS and DFS traversal, Dijkstra and other shortest paths, connectivity and partitioning. No dependencies.
+1 stars
from 141 · score 0.69