This is the scenario: There is an undirected graph with n nodes and e edges, all nodes are connected.
The question in the scenario: Every node can be considered as a person in a social network that shares or reads a content. It means that if A is connected to B, C and D, if A shares a content with the network, it will reach directly BCD. It means that to reach all the nodes in the network, it's just necessary that they are adjacent to a node which shared the content.
Q1: is there a way to find the best starting point to reach the entire network? Q2: is there a way to find a smallest path from that point?
I've already looked at salesman problem and prim'algorithm.