Outline an algorithm in pseudocode which takes a weighted, directed graph (that represents debt between people) as input and outputs the amount of money a person needs to pay as well as to whom this person is in debt to.
Specify the data structures you use in this algorithm and state and explain the total runtime complexity of the algorithm in terms of the amount of nodes (people) in the graph.
For the sake of the problem, assume that each person has a constant (O(1)) number of debts such that the number of edges (debts) in the graph is O(n).