Simple directed acyclic graph (DAG) implementation based on concurrent.futures
Project description
runner
Simple DAG (Directed Acyclic Graph) implementation based on python concurrent.futures
Installation
Runner only
- Download and install Python
- Install runner
pip install mltrip-runner
python -m runner action.json --plot
or
python -m runner action.yml --plot
5. Run DAG
python -m runner action.json
or
python -m runner action.yml
With runner-hub
git clone https://github.com/PC-Trip/runner-hub.git
- Install some requirements.txt
cd runner-hub/runner_hub/gmsh
pip install -r requirements.txt
- Plot some DAG
cd runner-hub/runner_hub/gmsh/tenex/container_simple/dag
python -m runner optimize/optimize.json --plot
5. Run some DAG
cd runner-hub/runner_hub/gmsh/tenex/container_simple/dag
python -m runner optimize/optimize.json
- See results
cd runner-hub/runner_hub/gmsh/tenex/container_simple/dag/work
Project details
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
mltrip-runner-0.0.20.tar.gz
(27.6 kB
view hashes)
Built Distribution
Close
Hashes for mltrip_runner-0.0.20-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | 1e5b7696d3343296298ddcd29a924b298327011288e549b626ef77e44a2f3902 |
|
MD5 | dd9b8d72b2ec42c81de1859e02a11814 |
|
BLAKE2b-256 | 7970e4d8e1b967a97ffad6917fbde1cbf5f0d8c6d64645bb9db410b9980b9a31 |