shortest path - How to find the least cost to visit every vertex in an undirected, weighted graph at least once starting from a predetermined vertex? -
The route taken is not to end back to the predefined head. In fact, the travel vendor has a problem that a top can be visited more than once.
Edit: Depending on the maximum of 10,000 characters and edges
its Not sure about, but I think it is optimal (probably not the most effective idea): Calculate the minimum path between each pair of digits, and then apply the travel vendor to this article.
Comments
Post a Comment