visit 标记数组,初值为0
dist【i】 记录i到起点距离,除i=k外其余为无穷
mark【i】【j】记录i到j距离,无边为-1或者无穷
void dijkstra(int k,int n)//起点为k,点数为n
{
for (int i = 1; i <= n; i++)
dist[i] = (i == k) ? 0 : INF;
memset(vis, 0, sizeof(vis));
for (int i = 1; i <= n; i++)
{
int mark = -1, mindis = INF;
for (int j = 1; j <= n; j++)
{
if (!vis[j] && dist[j] < mindis)
{
mindis = dist[j];
mark = j;
}
}
if (mark == -1)return;
vis[mark] = 1;
for (int j = 1; j <= n; j++)
{
if (!vis[j]&&g[mark][j]!=-1)
{
dist[j] = min(dist[j], dist[mark] + g[mark][j]);
}
}
}
}