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 order using input from
individual files

::

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.1.tar.gz (5.6 kB view hashes)

Uploaded Source

Supported by

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