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.17.tar.gz
(27.1 kB
view hashes)
Built Distribution
Close
Hashes for mltrip_runner-0.0.17-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | 18c2e9025a88bb6195819ada5745752508039e892d8a13d19ac54b0e4e4bd21e |
|
MD5 | 4cca99e248c7fa6a4985e652acc63c29 |
|
BLAKE2b-256 | f3282b3c92c08e4e57056a7786c607e2a2fe941cb3203e5a70b820145843b8df |