Find centralized, trusted content and collaborate around the technologies you use most.
Teams
Q&A for work
Connect and share knowledge within a single location that is structured and easy to search.
给定一个在边上具有不对称成本的图结构,如果您只能访问每个节点一次,有没有办法以最低成本遍历一组节点?问题被表述为这样的路径必须存在。
蛮力最终会解决问题。
我会使用A* 算法。