Maximum Number of Achievable Transfer Requests

Given directed transfer requests between n buildings, find the largest subset of requests such that each building's net incoming minus outgoing transfers is zero (so no building's employee count changes). With small input sizes, this reduces to enumerating/backtracking over subsets of requests to maximize the number of edges forming a zero-net flow at every vertex.