Problem Statement: Consider a social network having "N" people. Each person can be connected to any number of people(<=N-1) but the people he is connected to should be on the network. Task is to select minimum number of people to give a post such that it reaches everyone on the network. Note:Post will even reach to friends of friend.Eg If "A" is connected to "B" and "B" is connected to "C" then the post given to "A" will also reach to "C
Concepts Used: Spanning Trees