I'd really appreciate your help. I've been trying for a while and can't figure out how to programattically create a list where you start with one level in a list of people - MY friends- such as
graph["me"] = ["alison", "bob", "candy", "duane", "eric"]
Now everyone in that first level - Alison, Bob, through eric - has 5 unique friends each (2nd level), which is portrayed as:
graph["alison"] = ["ana", "ann", "ali" "andy", "arda"]
graph["bob"] = ["bill", "bray", "bran", "brad", "bam"]
etc.
now each of those - ana, ann, bill, bray etc. each have 5 friends each (3rd level) ... up to the 5th unique level. Once we reach the fifth level, I'll assume there are no more friends.
So really, I think what I want at the end is 5 ^ 5 unique lists that start with graph["xxx"]
I'm not actually worried about the name generation - we can make the names abc1, abc2, etc. I just want it to follow the rules and go 5 x 5 levels deep, following the pattern above.
Does that make sense? :) And yes, this is related to breadth-first search. Thanks so much.
Relevant github link: https://github.com/egonSchiele/grokking_algorithms/blob/master/06_breadth-first_search/python/01_breadth-first_search.py