- This web application takes transactions between persons as input and calculates new transactions between persons so that total number of transactions are minimised. It also generates and displays a graphical network showing all the transactions for easy understanding of the user.
- A Greedy algorithm is used to find all the transactions. The greedy algorithm is implemented using max Heaps.
- A max Heap is also implemented from scratch in javascript.
- The overall time complexity of the algorithm is
$O(n logn)$ . - vis.js is used to display the graphical network using an adjacency list containing the connection(edges/transactions) between nodes(persons).
