To solve the model, the shortest path and its length of every two nodes in the incomplete undigraph are calculated with FLOYD algorithm, and a predatory search algorithm is designed for the solution.

 
  • 为了求解上述模型;首先利用FLOYD算法求得不完全无向图中各节点间的最短路径和最短路径长度;然后设计了捕食搜索算法对模型进行求解.
今日热词
目录 附录 查词历史