Hi All
I have a situation where X people have given and received an amount of things amongst themselves. I need to be able to "net" off the series of related transactions.
In the simple example attached, person A has given 100 oranges to person B. Person B has given 70 oranges to person C. The actual net position of oranges is that Person A has Given person C 30 oranges, we have effectively excluded the instance where the start and end points that interact B.
To add further complexity, I need to keep the transactions separate for example:
If A went on to give 50 oranges to person D. Person D gave 20 oranges to E. Person E gave 5 oranges to person A, this would need to be considered separately to the transactions above because there is no link between A and C in the original series of transactions.
I have absolutely no clue where to begin with tackling this problem, and unfortunately, X in the problem I am trying to solve is >60 and manual processing will take a very, very long time.
I hope someone has an idea on how to solve the problem.
Cheers
Shaun
I have a situation where X people have given and received an amount of things amongst themselves. I need to be able to "net" off the series of related transactions.
In the simple example attached, person A has given 100 oranges to person B. Person B has given 70 oranges to person C. The actual net position of oranges is that Person A has Given person C 30 oranges, we have effectively excluded the instance where the start and end points that interact B.
To add further complexity, I need to keep the transactions separate for example:
If A went on to give 50 oranges to person D. Person D gave 20 oranges to E. Person E gave 5 oranges to person A, this would need to be considered separately to the transactions above because there is no link between A and C in the original series of transactions.
I have absolutely no clue where to begin with tackling this problem, and unfortunately, X in the problem I am trying to solve is >60 and manual processing will take a very, very long time.
I hope someone has an idea on how to solve the problem.
Cheers
Shaun