Also, I've also thought of Silicon Valley investor, operator and notables networks as a type of graph problem. And, I've often thought of working towards a specific introduction as a type of graph traversal problem.
What node foo in this graph do I need to connect to? What nodes bar[] surround foo? What is the strength of each edge connecting bar[node] to foo?
Getting from node baz to node foo is recursive:
Get_to_Node_Foo( node baz ):
Look at all the edges and nodes surrounding baz. Are you next to foo? Ask for intro.
Else, move to the node that seems closest to foo.
get_to_node_Foo( that_new_node ).
Comments
Also, I've also thought of Silicon Valley investor, operator and notables networks as a type of graph problem. And, I've often thought of working towards a specific introduction as a type of graph traversal problem.
What node foo in this graph do I need to connect to? What nodes bar[] surround foo? What is the strength of each edge connecting bar[node] to foo?
Getting from node baz to node foo is recursive:
Get_to_Node_Foo( node baz ): Look at all the edges and nodes surrounding baz. Are you next to foo? Ask for intro. Else, move to the node that seems closest to foo. get_to_node_Foo( that_new_node ).