图的基本算法的实现（Implementation of the basic algorithm of Graphs）.docVIP

图的基本算法的实现（Implementation of the basic algorithm of Graphs） # includes graph.h / * * 直观显示邻接表结构 * / void graph: displaystruct () { arcnode * arc; for (int i = 0; i graph.nvex; i + +) { arc = graph.adjlist [].firstarc; cout 顶点 endl; while (arc) { cout 邻接点 adjvex verbatim 权重 endl arc - weight; arc = arc - nextarc; } } } / * * 初始化bvisited数组, 为每次遍历做准备 * / void graph: initvisitarray () { for (int i = 0; i graph.nvex; i + +) bvisited [i] = false; } / / initvisitarray / * * construct * 初始化图为空图, 即让所有顶点的firstarc为null * / graph: the graph: () { for (int i = 0; i maxsize; i + +) { graph.adjlist [].firstarc = null; } graph.nvex = maxsize; } / / graph / * * dfs深度优先搜索 * / void graph: dfs (int startvex) { cout startvex; bvisited [startvex] = true; arcnode * arc = graph.adjlist [startvex].firstarc; while (arc) { if (! bvisited [arc - adjvex]) { dfs (v - adjvex); } arc = arc - nextarc; } } / / dfs / * * bfs广度优先搜索 * / void graph: bfs (int startvex) { int f (maxsize], front = - 1, rear = - 1. arcnode * arc; int p; rear rear = + 1)% maxsize; qu [rear] = startvex; cout startvex; bvisited [startvex] = true; while (front! = (rear) front (front = + 1)% maxsize; p = f [front]; arc = graph.adjlist [p].firstarc; while (arc) { if (! bvisited [arc - adjvex]) { rear rear = + 1)% maxsize; qu [rear] = adjvex verbatim. cout adjvex verbatim. bvisited [arc - adjvex] = true; } arc = arc - nextarc; } } } / / bfs / * * 从邻接矩阵构造邻接表 * / void graph: matrixtoadjlist (int date [] [maxsize]) { arcnode * arc; for (int row = 0; row - maxsize; row + +) { for (int a = 0; with maxsize; with + +) { if (data [row] [with]. = inf { arc = new arcnode; arc - adjvex = with; arc - weight = date [row] [with]; arc - nextarc = graph.adjlist [row].firstarc; graph.adjlist [row].firstarc = arc; } } } } / / matrixtoadjlist / * * 邻接表转化为邻接矩阵 * / void graph: adjlisttomatrix () { arcnode * arc; int row, with. for (row = 0; row - graph.nvex; row + +) { for (with = 0, with graph.nvex; with + +) { the