Create 图.md

IRVING-L · web-flow · commit ebddd4199ea2 · 2021-02-08T12:12:11.000+08:00
diff --git a/图.md b/图.md
@@ -0,0 +1,151 @@
+### 图
+
+**邻接矩阵表示法**
+
+*图的定义*
+
+~~~cpp
+struct AMGraph
+{
+    //图的顶点向量
+    char Vexs[MAXSIZE];
+    //图的邻接矩阵
+    int Arcs[MAXSIZE];
+    //图的总顶点数和总边数
+    int vexnum, arcnum;
+};
+~~~
+
+*创建无向网*
+
+~~~cpp
+void CreatUDN(AMGraph &G)
+{
+    //第一步：输入无向图的顶点数目
+    cout << "input num" << endl;
+    cin >> G.arcnum >> G.arcnum; //输入总顶点数和总边数
+    //第二步：输入结点的名称，保存在一维数组中
+    cout << "input vexs" << endl;
+    for (int i = 0; i < G.vexnum; ++i)
+    {
+        cin >> G.vexs[i];
+    }
+    //第三步：将邻接矩阵的元素值置为无穷大
+    for (int i = 0; i < G.arcnum; ++i)
+    {
+        for (int j = 0; j < G.arcnum; ++j)
+        {
+            G.arcs[i][j] = INT32_MAX;
+        }
+    }
+    //第四步：输入顶点相互关系以及权重
+    for (int k = 0; k < G.arcnum;++k)
+    {
+        int i, j, weight;
+        char a, b;
+        cin >> a >> b >> weight;
+        //由输入的顶点a和b查找到对应的下标i,j
+        i = LocateVex(G,a)
+        j = LocateVex(G,b)
+        G.arcs[i][j] = G.arcs[j][i] = weight;
+    }
+}
+~~~
+
+*LocateVex函数*
+
+~~~cpp
+int LocateVex(AMGraph &G, const char &e)
+{
+    for (int i = 0; i < G.vexnum;++i)
+    {
+        if(G.vexs[i]==e)
+            return i;
+    }
+    return -1;
+}
+~~~
+
+**邻接表表示法**
+
+*定义*
+
+~~~cpp
+//边表的定义
+struct ArcNode
+{
+    int adjvex;       //保存顶点的下标
+    int weight;       //保存边的权重
+    ArcNode *nextarc; //指向下一个边结点
+};
+//顶点表的定义
+struct VNode
+{
+    //数据域，存放顶点
+    VecTexType data;
+    //指针域，用于保存邻接表的
+    ArcNode *firstarc;
+};
+//图的定义
+struct ALGraph
+{
+    //定义一个数组，保存图的顶点
+    VNode vexs[MAXSIZE];
+    //定义两个变量，保存当前图的顶点个数以及边的条数
+    int vexnum, arcnum;
+};
+~~~
+
+*定位算法*
+
+~~~cpp
+int LocateVex(ALGraph &G, const char &v)
+{
+    for (int i = 0; i < G.vexnum; ++i)
+    {
+        if (G.vexs[i].data == v)
+            return i;
+    }
+    return -1;
+}
+~~~
+
+*创建无向图算法*
+
+~~~cpp
+void CreatUDG(ALGraph &G)
+{
+    //第一步：输入图的顶点个数以及边的条数
+    cout << "info" << endl;
+    cin >> G.vexnum >> G.arcnum;
+    //第二步：给顶点向量赋值
+    for (int i = 0; i < G.vexnum; ++i)
+    {
+        cin >> G.vexs[i].data;
+        G.vexs[i].firstarc = nullptr;
+    }
+    //给每个顶点所含的边赋值
+    for (int j = 0; j < G.arcnum; ++j)
+    {
+        cout << "input info about arc" << endl;
+        char a, b;
+        //int w;
+        cin >> a >> b;
+        int i = LocateVex(G, a);
+        int j = LocateVex(G, b);
+        //申请动态内存
+        ArcNode *p = new ArcNode;
+        p->adjvex = j;
+        //p->weight = w;
+        p->nextarc = G.vexs[i].firstarc;
+        G.vexs[i].firstarc = p;
+
+        ArcNode *q = new ArcNode;
+        q->adjvex = i;
+        //q->weight = w;
+        q->nextarc = G.vexs[j].firstarc;
+        G.vexs[j].firstarc = q;
+    }
+}
+~~~
+
