Algorithm for finding strongest connection for a user on social network
Your algorithm doesn't work.  BFS doesn't explore all paths.  One of the paths you haven't explored might have much higher strength than all the ones you have explored.  There exists a counterexample with only four or five nodes (depending on the exact details of how you implement the steps outlined in your overview).  I'll let you have the fun of finding it.