#StackBounty: #algorithm #graph Algorithm for shortest path to traverse all nodes by several salesmen

Bounty: 50

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?


Get this bounty!!!

Leave a Reply

This site uses Akismet to reduce spam. Learn how your comment data is processed.