Your process is so vague, it's like saying the process to get from Seattle to Hawaii is:
1. Leave Seattle.
2. Travel.
2. Arrive in Hawaii
Consider writing a connection counter for linked in. How many connections do you have, and how many 2nd level connections do you have through those people. If you decide to break this down into smaller problems, you are going about it the wrong way in all likelyhood. An optimal solution will involve a dynamic programming algorithm, which solves the entire problem in a tricky way (a clever hack).
* Make a list of use cases
* Grab a stack of 3x5 cards and start writing nouns on them
* Check to see if someone else has partly or completely solved the same problem already
* Write down the basic data structures associated with the problem
* Identify a minimal command-line program you could write to investigate the hardest problem(s)
* from __future__ import solution (or: M-x solve-problem)
I disagree. There is a process, but it is so basic we may not realize it:
1. identify the big problem
2. break it down into smaller problems
3. solve the smaller problems
4. repeat as needed