https://github.com/kdheepak/iou

Solve for the optimally minimum number of transactions to settle debts and expenses with friends
https://github.com/kdheepak/iou

Last synced: 23 days ago
JSON representation

Solve for the optimally minimum number of transactions to settle debts and expenses with friends

• Host: GitHub
• URL: https://github.com/kdheepak/iou
• Owner: kdheepak
• License: bsd-3-clause
• Created: 2015-12-10T06:53:51.000Z (about 9 years ago)
• Default Branch: master
• Last Pushed: 2017-07-11T03:18:42.000Z (over 7 years ago)
• Last Synced: 2024-11-20T09:29:26.298Z (about 1 month ago)
• Language: Python
• Homepage:
• Size: 425 KB
• Stars: 1
• Watchers: 3
• Forks: 0
• Open Issues: 1
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# iou

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







## Install

    pip install py-iou

    pip install py-iou --upgrade

### Dependencies

* Install [`ipopt`](https://projects.coin-or.org/Ipopt)

If you have [Anaconda](https://www.continuum.io/downloads) or [Miniconda](https://conda.io/miniconda.html), you can install it using the following command.

```bash

conda install -c conda-forge ipopt

```

## Run

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

        iou --data iou/data/transactions.csv

    OR

        iou --data iou/data/transactions.csv --verbose







Use help

    iou --help

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

## Contribution

Feel free to submit a pull request.