#include <stdio.h>
#include <stdlib.h>
#include <malloc.h>
#include <string.h>
#define MAX 100
#define INF (~(0x1<<31))
#define isLetter(a) ((((a)>='a')&&((a)<='z')) || (((a)>='A')&&((a)<='Z')))
#define LENGTH(a) (sizeof(a)/sizeof(a[0]))
typedef struct _graph
{
char vexs[MAX];
int vexnum;
int edgnum;
int matrix[MAX][MAX];
}Graph, *PGraph;
static int get_position(Graph g, char ch)
{
int i;
for (i = 0; i<g.vexnum; i++)
if (g.vexs[i] == ch)
return i;
return -1;
}
static char read_char()
{
char ch;
do {
ch = getchar();
} while (!isLetter(ch));
return ch;
}
Graph* create_graph()
{
char c1, c2;
int v, e;
int i, j, weight, p1, p2;
Graph* pG;
printf("input vertex number: ");
scanf_s("%d", &v);
printf("input edge number: ");
scanf_s("%d", &e);
if (v < 1 || e < 1 || (e >(v * (v - 1))))
{
printf("input error: invalid parameters!\n");
return NULL;
}
if ((pG = (Graph*)malloc(sizeof(Graph))) == NULL)
return NULL;
memset(pG, 0, sizeof(Graph));
pG->vexnum = v;
pG->edgnum = e;
for (i = 0; i < pG->vexnum; i++)
{
printf("vertex(%d): ", i);
pG->vexs[i] = read_char();
}
for (i = 0; i < pG->vexnum; i++)
{
for (j = 0; j < pG->vexnum; j++)
{
if (i == j)
pG->matrix[i][j] = 0;
else
pG->matrix[i][j] = INF;
}
}
for (i = 0; i < pG->edgnum; i++)
{
printf("edge(%d):", i);
c1 = read_char();
c2 = read_char();
scanf_s("%d", &weight);
p1 = get_position(*pG, c1);
p2 = get_position(*pG, c2);
if (p1 == -1 || p2 == -1)
{
printf("input error: invalid edge!\n");
free(pG);
return NULL;
}
pG->matrix[p1][p2] = weight;
pG->matrix[p2][p1] = weight;
}
return pG;
}
Graph* create_example_graph()
{
char vexs[] = { 'A', 'B', 'C', 'D', 'E', 'F', 'G' };
int matrix[][9] = {
{ 0, 12, INF, INF, INF, 16, 14 },
{ 12, 0, 10, INF, INF, 7, INF },
{ INF, 10, 0, 3, 5, 6, INF },
{ INF, INF, 3, 0, 4, INF, INF },
{ INF, INF, 5, 4, 0, 2, 8 },
{ 16, 7, 6, INF, 2, 0, 9 },
{ 14, INF, INF, INF, 8, 9, 0 } };
int vlen = LENGTH(vexs);
int i, j;
Graph* pG;
if ((pG = (Graph*)malloc(sizeof(Graph))) == NULL)
return NULL;
memset(pG, 0, sizeof(Graph));
pG->vexnum = vlen;
for (i = 0; i < pG->vexnum; i++)
pG->vexs[i] = vexs[i];
for (i = 0; i < pG->vexnum; i++)
for (j = 0; j < pG->vexnum; j++)
pG->matrix[i][j] = matrix[i][j];
for (i = 0; i < pG->vexnum; i++)
for (j = 0; j < pG->vexnum; j++)
if (i != j && pG->matrix[i][j] != INF)
pG->edgnum++;
pG->edgnum /= 2;
return pG;
}
static int first_vertex(Graph G, int v)
{
int i;
if (v<0 || v>(G.vexnum - 1))
return -1;
for (i = 0; i < G.vexnum; i++)
if (G.matrix[v][i] != 0 && G.matrix[v][i] != INF)
return i;
return -1;
}
static int next_vertix(Graph G, int v, int w)
{
int i;
if (v<0 || v>(G.vexnum - 1) || w<0 || w>(G.vexnum - 1))
return -1;
for (i = w + 1; i < G.vexnum; i++)
if (G.matrix[v][i] != 0 && G.matrix[v][i] != INF)
return i;
return -1;
}
static void DFS(Graph G, int i, int *visited)
{
int w;
visited[i] = 1;
printf("%c ", G.vexs[i]);
for (w = first_vertex(G, i); w >= 0; w = next_vertix(G, i, w))
{
if (!visited[w])
DFS(G, w, visited);
}
}
void DFSTraverse(Graph G)
{
int i;
int visited[MAX];
for (i = 0; i < G.vexnum; i++)
visited[i] = 0;
printf("DFS: ");
for (i = 0; i < G.vexnum; i++)
{
if (!visited[i])
DFS(G, i, visited);
}
printf("\n");
}
void BFS(Graph G)
{
int head = 0;
int rear = 0;
int queue[MAX];
int visited[MAX];
int i, j, k;
for (i = 0; i < G.vexnum; i++)
visited[i] = 0;
printf("BFS: ");
for (i = 0; i < G.vexnum; i++)
{
if (!visited[i])
{
visited[i] = 1;
printf("%c ", G.vexs[i]);
queue[rear++] = i;
}
while (head != rear)
{
j = queue[head++];
for (k = first_vertex(G, j); k >= 0; k = next_vertix(G, j, k))
{
if (!visited[k])
{
visited[k] = 1;
printf("%c ", G.vexs[k]);
queue[rear++] = k;
}
}
}
}
printf("\n");
}
void print_graph(Graph G)
{
int i, j;
printf("Martix Graph:\n");
for (i = 0; i < G.vexnum; i++)
{
for (j = 0; j < G.vexnum; j++)
printf("%10d ", G.matrix[i][j]);
printf("\n");
}
}
void prim(Graph G, int start)
{
int min, i, j, k, m, n, sum;
int index = 0;
char prims[MAX];
int weights[MAX];
prims[index++] = G.vexs[start];
for (i = 0; i < G.vexnum; i++)
weights[i] = G.matrix[start][i];
weights[start] = 0;
for (i = 0; i < G.vexnum; i++)
{
if (start == i)
continue;
j = 0;
k = 0;
min = INF;
while (j < G.vexnum)
{
if (weights[j] != 0 && weights[j] < min)
{
min = weights[j];
k = j;
}
j++;
}
prims[index++] = G.vexs[k];
weights[k] = 0;
for (j = 0; j < G.vexnum; j++)
{
if (weights[j] != 0 && G.matrix[k][j] < weights[j])
weights[j] = G.matrix[k][j];
}
}
sum = 0;
for (i = 1; i < index; i++)
{
min = INF;
n = get_position(G, prims[i]);
for (j = 0; j < i; j++)
{
m = get_position(G, prims[j]);
if (G.matrix[m][n]<min)
min = G.matrix[m][n];
}
sum += min;
}
printf("PRIM(%c)=%d: ", G.vexs[start], sum);
for (i = 0; i < index; i++)
printf("%c ", prims[i]);
printf("\n");
}
void main()
{
Graph* pG;
pG = create_example_graph();
prim(*pG, 0);
}
## 实验结果 ##