3,881
社区成员
发帖
与我相关
我的任务
分享
#include <stdio.h>
#include <stdint.h>
#include <stack>
#include <queue>
using namespace std;
#define MAX_NODE 26
typedef int InfoType;
typedef int ElemType;
typedef int VRType;
typedef char VertexType;
typedef enum
{
DG = 0,
DN,
UDG,
UDN
}GraphKind;
typedef struct ArcCell
{
VRType adj;
InfoType *info;
}ArcCell, AdjMatrix[MAX_NODE][MAX_NODE];
typedef struct
{
VertexType vexs[MAX_NODE];
AdjMatrix arcs;
int vexnum;
int arcnum;
GraphKind kind;
}MGraph;
void BuildUDG(MGraph *G)
{
int i = 0, j = 0, k = 0;
char c = 'a';
int n1[] = {0, 0, 1, 1, 2, 2, 3, 4, 5};
int n2[] = {1, 2, 3 ,4, 5, 6, 7, 7, 6};
if (!G)
return;
G->vexnum = 8;
G->arcnum = 9;
G->kind = UDG;
for (i=0; i<G->vexnum; ++i)
G->vexs[i] = c++;
for (i=0; i<G->vexnum; ++i)
{
for (j=0; j<G->vexnum; ++j)
{
G->arcs[i][j].adj = 0;
G->arcs[i][j].info = NULL;
}
}
for (k=0; k<G->arcnum; ++k)
{
G->arcs[n1[k]][n2[k]].adj = 1;
G->arcs[n2[k]][n1[k]].adj = G->arcs[n1[k]][n2[k]].adj;
}
}
static unsigned char visited[MAX_NODE] = {0};
int NextAdjVex(MGraph *G, int v, int w)
{
int i = 0;
if (!G || v < 0)
return -1;
for (i=++w; i<G->vexnum; ++i)
if (G->arcs[v][i].adj != 0 && G->arcs[v][i].adj != INT32_MAX)
return i;
return -1;
}
void DFS(MGraph *G, int v)
{
int i = 0;
if (!G)
return;
visited[v] = 1;
printf("%c ", G->vexs[v]);
for (i=NextAdjVex(G, v, -1); i>=0; i=NextAdjVex(G, v, i))
{
if (!visited[i])
DFS(G, i);
}
}
void DFSRecursion(MGraph *G)
{
int i = 0;
if (!G)
return;
for (i=0; i<G->vexnum; ++i)
visited[i] = 0;
for (i=0; i<G->vexnum; ++i)
{
if (!visited[i])
DFS(G, i);
}
printf("\n");
}
void DFSStack(MGraph *G)
{
int i = 0, j = 0, k = 0;
stack<int> s;
if (!G)
return;
for (i=0; i<G->vexnum; ++i)
visited[i] = 0;
for (i=0; i<G->vexnum; ++i)
{
if (!visited[i])
{
visited[i] = 1;
printf("%c ", G->vexs[i]);
s.push(i);
while (!s.empty())
{
j = s.top();
s.pop();
for (k=NextAdjVex(G, j, -1); k>=0; k=NextAdjVex(G, j, k))
{
if (!visited[k])
{
visited[k] = 1;
printf("%c ", G->vexs[k]);
s.push(k);
j = k;
}
}
}
}
}
printf("\n");
}
void BFSQueue(MGraph *G)
{
int i = 0, j = 0, k = 0;
queue<int> s;
if (!G)
return;
for (i=0; i<G->vexnum; ++i)
visited[i] = 0;
for (i=0; i<G->vexnum; ++i)
{
if (!visited[i])
{
visited[i] = 1;
printf("%c ", G->vexs[i]);
s.push(i);
while (!s.empty())
{
j = s.front();
s.pop();
for (k=NextAdjVex(G, j, -1); k>=0; k=NextAdjVex(G, j, k))
{
if (!visited[k])
{
visited[k] = 1;
printf("%c ", G->vexs[k]);
s.push(k);
}
}
}
}
}
printf("\n");
}
int main()
{
MGraph G = {0};
BuildUDG(&G);
DFSRecursion(&G);
DFSStack(&G);
BFSQueue(&G);
getchar();
}
void DFS(MGraph *G, int v)
{
int i = 0;
if (!G)
return;
visited[v] = 1;
printf("%c ", G->vexs[v]);
for (i=NextAdjVex(G, v, -1); i>=0; i=NextAdjVex(G, v, i))
{
if (!visited[i])
DFS(G, i);
}
}
void DFSRecursion(MGraph *G)
{
int i = 0;
if (!G)
return;
for (i=0; i<G->vexnum; ++i)
visited[i] = 0;
for (i=0; i<G->vexnum; ++i) //如果不需要遍历那些不可能走到的节点,那这个循环根本不需要
{
if (!visited[i])
DFS(G, i);
}
printf("\n");
}