liquid-democracy-6.sol

event Winner(int proposal, int votes);

function findWinningProposal() public returns(int, int) {
uint numVoters = validVoters.length;
bool[] memory visited = new bool[](numVoters);
int maxVotes = -1;
int winningProposal = -1;

// loop through the validVoters array
for (uint i = 0; i < numVoters; i++) {
  if (visited[i]) continue;
  uint voter = i; // start processing the voter
  
  // accumulate total voting power
  uint totalVotes = 1;
  visited[voter] = true;
  
  // traverse the delegation chain until we reach a vanilla voter - add the voting power and mark voters as visited
  while(voters[validVoters[voter]].state == State.Delegated) {
    voter = voters[validVoters[voter]].delegatedTo;
    if (!visited[voter]) {
      totalVotes += 1;
      visited[voter] = true;
    }
  }
  
  // reached a voter who has voted or hasn't participated in voting/delegation
  if (voters[validVoters[voter]].state == State.Voted) {
    Proposal storage proposal = proposals[voters[validVoters[voter]].vote];
    proposal.numVotes += totalVotes;
    if (maxVotes < int(proposal.numVotes)) {
      maxVotes = int(proposal.numVotes);
      winningProposal = int(voters[validVoters[voter]].vote);
    }
  }
}

emit Winner(winningProposal, maxVotes);
}