Dijkstra_A note on Two Problems in Connexion with Graphs.pdf
We consider n points (nodes), some or all pairs of which are connected by a branch; the length of each branch is given. We restrict ourselves to the case where at least one path exists between any two nodes. We now consider two problems. Problem 1. Constrnct the tree of minimum total length between
用户评论
zuao 2020-07-21 18:27:24
坑爹啊,怎么就一页