......

原创 单源最短路dijkstra算法

<br />void Dijkstra(int n, int v, int dist[], int prev[], int * * c) { int *check = malloc(sizeof(int) * (n + 1)); int i, j; for (i = 1;i <= n;i++) { dist[i] = c[v][i]; check[i] = 0; if (MAXINT == dist[i]) prev[i] = 0; els