1,图的存储结构
a.领接矩阵表示法
#define MaxInt -1//假设-1为最大值
#define MvNum 100//最大顶点数
typedef struct {
char vexs[MvNum];//假设顶点存储字符型数据
int arcs[MvNum][MvNum];//假设边的权值为整形
int vexnum, arcnum;//图的当前顶点数和边数
}AmGraph;
int located(AmGraph G, char v) {
for (int i = 0; i < G.vexnum; i++) {
if (v == G.vexs[i])
return i;
}
}
void createUdn(AmGraph& G) {//创建邻接矩阵
cout << "请输入总顶点数和总边数:";
cin >> G.vexnum >> G.arcnum;
cout << "请依次输入顶点数据:" << endl;
for (int i = 0; i < G.vexnum; i++) {//依次输入顶点数据
cin >> G.vexs[i];
}
for (int i = 0; i < G.vexnum; i++) {//领接矩阵初始化
for (int j = 0; j < G.vexnum; j++) {
G.arcs[i][j] = MaxInt;
}
}
for (int k = 0; k < G.arcnum; k++) {
cout << "请输入一条边所依附的两个顶点及权值:" << endl;
char v1 = 0, v2 = 0;int w = 0;
cin >> v1 >> v2 >> w;
int i = located(G, v1);
int j = located(G, v2);
G.arcs[i][j] = w;
G.arcs[j][i] = G.arcs[i][j];
}
}
void showUdn(AmGraph G) {
cout << "顶点数据为:";
for (int i = 0; i < G.vexnum; i++) {
cout << G.vexs[i] << ' ';
}
cout << endl << "领接矩阵为:" << endl;
for (int i = 0; i < G.vexnum; i++) {
for (int j = 0; j < G.vexnum; j++) {
cout << G.arcs[i][j] << ' ';
}
cout << endl;
}
}
int main()
{
AmGraph G;
createUdn(G);
showUdn(G);
}
b.领接表法
#define Mvnum 100//最大顶点数
typedef struct arcNode{//边结点
int dajvex;
struct arcNode* next;
}arcNode;
typedef struct vNode {//顶点
char data;//顶点数据
arcNode* firstarc;//指向第一条边指针
}vNode,adjList[Mvnum];//顶点数据表
typedef struct {//领接表
adjList vertices;//顶点数组
int vexnum, arcnum;//图的当前顶点数和边数
}AlGraph;
int located(AlGraph &G, char v) {//确定v在G中的位置
for (int i = 0; i < G.vexnum; i++) {
if (v == G.vertices[i].data)
return i;
}
}
void createUdg(AlGraph& G) {//创建领接表
cout << "请输入顶点数和边数:";
cin >> G.vexnum >> G.arcnum;
cout << "请依次输入顶点数据:" << endl;
for (int i = 0; i < G.vexnum; i++) {//输入顶点数据并初始化所有顶点
cin >> G.vertices[i].data;
G.vertices[i].firstarc = NULL;
}
for (int i = 0; i < G.arcnum; i++) {
char v1, v2;
cout << "请输入一条边所依附的两个顶点及权值:" << endl;
cin >> v1 >> v2;
int j = located(G, v1), k = located(G, v2);
arcNode* p1 = new arcNode;
p1->dajvex = k;
p1->next = G.vertices[j].firstarc;
G.vertices[j].firstarc = p1;
arcNode* p2 = new arcNode;
p2->dajvex = j;
p2->next = G.vertices[k].firstarc;
G.vertices[k].firstarc = p2;
}
}
void showUdg(AlGraph &G) {
for (int i = 0; i < G.vexnum; i++) {
cout << "顶点" << G.vertices[i].data << ':';
arcNode* p = G.vertices[i].firstarc;
while (p) {
cout << p->dajvex << ' ';
p = p->next;
}
cout << endl;
}
}
int main()
{
AlGraph G;
createUdg(G);
showUdg(G);
}