#include<iostream>
#include<queue>
#include<algorithm>
#define Status int//为了与数据结构的类C语言对应,故用Status代替
#define OK 1
#define ERROR 0
#define Max_Vertex_Num 20
#define InfoType int
#define VertexType char
using namespace std;
bool visited[Max_Vertex_Num];
Status(*VisitFunc)(VertexType v);
typedef struct ArcNode{
int adjvex;//该弧所指的向的顶点位置
struct ArcNode *nextarc;
InfoType *info;//权
}ArcNode;
typedef struct VNode{
VertexType data;//顶点信息
ArcNode *firstarc;
}VNode,AdjList[Max_Vertex_Num];
typedef struct{
AdjList vertices;
int vexnum, arcnum;//顶点数,弧数
//char kind;
}ALGraph;
Status Get_LocateVex(ALGraph G,char t)
{
for (int i = 0; i < G.vexnum;i++)
if (G.vertices[i].data == t)
return i;
return ERROR;
}
Status Create_ALGraph(ALGraph& G)//UD
{
cout << "顶点数 弧数:";
cin >> G.vexnum >> G.arcnum;
cout << "顶点:";
图的邻接表存储及DFS,BFS遍历
最新推荐文章于 2022-11-24 11:25:49 发布