数据结构-图-C语言-邻接表-图的遍历

数据结构-图-C语言-邻接表-图的遍历

所需的结构

typedef int Vertex;
typedef int WeightType;

typedef struct GNode *pGNode;
struct GNode {
	int nv;
	int ne;
	AdjList g;
};
typedef pGNode LGraph;

/*边*/
typedef struct ENode *pENode;
struct ENode {
	Vertex v, w;//有向边v->w
	WeightType weight;//权重
};
typedef pENode Edge;

//链表的头结点
struct VNode {
	pAdjVNode firstEdge;
};
typedef VNode AdjList[Max];

//链表的边结点
typedef struct AdjVNode *pAdjVNode;
struct AdjVNode {
	Vertex adjV;//下个邻接点的下标
	WeightType weight;
	pAdjVNode next;//下个头指针
};

实现

//假设此数组已经初始化全部false!!
bool visited[100];

void visit(Vertex V){
	printf("正在访问顶点%d\n", V);
}

/*
* @program 深度遍历
*/
void DFS(Vertex v, LGraph graph, void(*visit)(Vertex v)) {
	pAdjVNode vNode = graph->g[v].firstEdge;

	visit(v);
	visited[v] = true;//标记为访问过

	for (vNode = graph->g[v].firstEdge; vNode; vNode->next) {
		if (!visited[vNode->adjV]) {
			DFS(vNode->adjV, graph,visit);
		}
	}
}