Skip to main content

A python package to find optimal number of transactions betweeen friends

Project description

iou
===

A python module using networkx, pyomo and ipopt to solve for the
optimally minimum number of transactions to settle debts/expenses
between friends.

.. raw:: html

<p align="center">

.. raw:: html

</p>

Install
-------

::

pip install py-iou
pip install py-iou --upgrade

Dependencies
~~~~~~~~~~~~

- Install ```ipopt`` <https://projects.coin-or.org/Ipopt>`__

Run
---

- Run the following to find the optimal transactions using input from
transactions.csv

::

iou --data iou/data/transactions.csv

.. raw:: html

<p align="center">

.. raw:: html

</p>

Use help

::

iou --help

A transactions.csv file is required to find the optimal order

Contribution
------------

Feel free to submit a pull request.

Project details


Download files

Download the file for your platform. If you're not sure which to choose, learn more about installing packages.

Source Distribution

py-iou-1.0.2.tar.gz (5.6 kB view details)

Uploaded Source

File details

Details for the file py-iou-1.0.2.tar.gz.

File metadata

  • Download URL: py-iou-1.0.2.tar.gz
  • Upload date:
  • Size: 5.6 kB
  • Tags: Source
  • Uploaded using Trusted Publishing? No

File hashes

Hashes for py-iou-1.0.2.tar.gz
Algorithm Hash digest
SHA256 8a44175ce8bc01694cf6e71f297ca722ed4e697f27900912a29ba4084f9a5fde
MD5 816865bdcabb379bc7d265c03c1eff16
BLAKE2b-256 edf8651b28383e8a78b27bf8e7cec949f953e6a39b19089c3b82db6c9e1a6306

See more details on using hashes here.

Supported by

AWS Cloud computing and Security Sponsor Datadog Monitoring Depot Continuous Integration Fastly CDN Google Download Analytics Pingdom Monitoring Sentry Error logging StatusPage Status page