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.1.2.tar.gz
(28.8 kB
view hashes)
Built Distribution
Close
Hashes for mltrip_runner-0.1.2-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | a11b3c4401994191317e3d95776728827795e3251c3097a0a785f20c24886209 |
|
MD5 | 0fa39ab769996d01e090577a0c937075 |
|
BLAKE2b-256 | 62073f3eeb4e9f9b229f5177a18be0cc8dc3548e2140c333e3a88335fb90ef8f |