There is an unweighted and directed graph that may contain bidirectional edges. There is a fixed number of salesmen. Each salesman can start from any node. Each node should be visited at least once. I need to minimize each salesman’s path. Which algorithm can I use to solve this problem?