phoenix13suns的专栏

<br />Hash 和 Dijkstra 的速度相互制衡，不知道什么时候是最优的<br /> <br />#include<stdio.h>#include <string.h>#include <string>#include <set>#define N 305#define INF 0x7ffffffusing namespace std;int M;int path[N];bool mark[N];int h[N];int map[N][N];str

#include #define N 101#define MAX 0x7ffffff//不要设成最大值 否者会加出负数int n;int mark[N];int map[N][N];int path[N];//存放1到n的最短路void dij(int v){ int min,i,j,k,dis; for (i=1;i

<br />Dijkstra<br /> <br />#include<stdio.h>#define N 201#define INF 0x7ffffffint map[N][N];int mark[N];int path[N];int n;void Dij(int start){ int i,j,min,k,dis; for (i=0;i<n;i++) { path[i]=map[start][i]; ma