= UINT_MAX &&
graph[get(nextNode)][get(node)] + get(nextNode) (node)..., UINT_MAX, UINT_MAX, 16, 14},
{12, 0, 10, UINT_MAX, UINT_MAX, 7, UINT_MAX...},
{UINT_MAX, 10, 0, 3, 5, 6, UINT_MAX},
{UINT_MAX..., UINT_MAX, 3, 0, 4, UINT_MAX, UINT_MAX},
{UINT_MAX, UINT_MAX, 5, 4,...{14, UINT_MAX, UINT_MAX, UINT_MAX, 8, 9, 0}
}; // 图对应的连接矩阵
auto results = dijkstra