Description: To solve the PMP problem, the K node is found in the N node, making the rest of the rest of the N-k nodes to be the shortest distance to the K node. K is a custom value. The input file is the xlsx format, the distance ma
Platform: |
Size: 163840 |
Author: 大纲 |
Hits: