图的经典算法

void Prim(MatGraph g, int v)
{
	int closet[MAXV];
	int lowcost[MAXV];
	int min;
	int i, j, k;
	for (i = 0; i  g.edges[k][j])
			{
				lowcost[j] = g.edges[k][j];
				closet[j] = k;
			}
		}
	}
}

typedef struct {
	int u;
	int v;
	int w;
}Edge;
void Kruskal(MatGraph g)
{
	int i, j, k;
	int u1, v1;
	int sn1, sn2;
	Edge E[MAXV];
	int vset[MAXV];
	k = 0;
	for (i = 0; i 

void Dijkstral(MatGraph g, int v)
{
	int i, j, u;
	int mindist;
	int path[MAXV];
	int dist[MAXV];
	int S[MAXV];
	for (i = 0; i 

void Floyd(MatGraph g)
{
	int A[MAXV][MAXV];
	int path[MAXV][MAXV];
	int i, j, k;
	for (i = 0; i  A[i][k] + A[k][j])
				{
					A[i][j] = A[i][k] + A[k][j];
					path[i][j] = path[k][j];
				}
			}
		}
	}

}
void Dispath(MatGraph g, int A[][MAXV], int path[][MAXV])
{
	int apath[MAXV], d;
	int i, j, k;
	for (i = 0; i = 0; k--)
					printf(",%d", apath[k]);
				printf("\t路径长度为:%d\n", A[i][j]);
			}
		}
	}
}

typedef struct {
	InfoType info;
	int count;//存放入度
	ArcNode* firstarc;
}VNode;
void TopSort(AdjGraph* G)
{
	int i, j;
	int St[MAXV], top = -1;
	ArcNode* p;
	for (i = 0; i n; i++)
		G->adjlist[i].count = 0;
	for (i = 0; i n; i++)
	{
		p = G->adjlist[i].firstarc;
		while (p != NULL)
		{
			G->adjlist[p->adjvex].count++;
			p = p->nextarc;
		}

	}
	for (i = 0; i n; i++)
	{
		if (G->adjlist[i].count == 0)
			St[++top] = i;
	}
	while (top != -1)
	{
		i = St[top--];
		printf("%d ", i);
		p = G->adjlist[i].firstarc;
		while (p != NULL)
		{
			G->adjlist[p->adjvex].count--;
			if (G->adjlist[p->adjvex].count == 0)
				St[++top] = p->adjvex;
			p = p->nextarc;
		}
		
	}
}