Create an algorithm - TSP/ BB

Hi, My problem statement is as follows - There are 150 Companies (C1,C2,C3,C4.....C150) and 200 Directors (D1,D2,D3...D200) Each company can have multiple directors Each director can be on multiple companies Each Director is therefore connected with other directors because they are on the same company Objective : To meet and gather contact information of all directors Starting Point : You have the contact information of one director Rules : You can meet a director only after you have their contact information. Once you have met a director, you can ask for contact info for upto 2 other directors from the companies he is on. Sometimes you might only get 0 or 1 person who may not be the next most suitable director either. Once you have one director, you get the contact info of two other directors, Once you have any director, you can reach two other directors and so on to complete all the directors. Input : CSV/ SQL DB consisting of directors and companies Output : List comprising of directors to approach and ask contact details of and then who to approach one after the other. The time taken to get the information of any two directors is 3 days. What is the shortest time to meet all directors?