用MiniZinc求解并显示最短路径问题的有序边

include "globals.mzn";

% 定义图的结构
int: num_nodes;  % 节点数量
set of int: NODES = 1..num_nodes;
array[NODES, NODES] of int: graph;  % 邻接矩阵或邻接表表示的图

% 定义路径的有序边
array[NODES-1] of var NODES: path;

% 定义路径的起始节点和目标节点
var NODES: start_node;
var NODES: target_node;

% 约束路径的起始节点和目标节点
constraint path[1] = start_node;
constraint path[num_nodes-1] = target_node;

% 约束路径中的边的顺序和长度
constraint forall(i in 1..num_nodes-2)(
  graph[path[i], path[i+1]] > 0
);

% 定义目标函数（路径长度）
var int: path_length = sum(i in 1..num_nodes-2)(graph[path[i], path[i+1]]);

% 最小化目标函数
solve minimize path_length;

% 输出最短路径的有序边和路径长度
output ["最短路径的有序边：\(path)\n"] ++
       ["最短路径长度：\(path_length)\n"];