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.16.tar.gz
(27.0 kB
view hashes)
Built Distribution
Close
Hashes for mltrip_runner-0.0.16-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | 3667798e1a34a8a8f0f195f2f3676523a21f7faa6b1b446bd881c5d684d3036f |
|
MD5 | ef9021aaf5ce24e0405bec6d9710e2b5 |
|
BLAKE2b-256 | f08f3ba4eddbf6d6a786a75986872af07ecb6fa3a111965acf132f19a27bb555 |