From a56aa1d04859c611fdd1fc43b4a5b0dcf0353372 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?=E5=BE=A1=E5=9D=82=E6=98=B4?= <gugugulaocuchen@gmail.com>
Date: Wed, 4 Dec 2024 22:09:22 +0800
Subject: [PATCH] =?UTF-8?q?init=20Graph=E7=B1=BB?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 homework5/CMakeLists.txt |  3 ++-
 homework5/Graph.h        | 27 +++++++++++++++++++++++++++
 homework5/test1.cpp      | 31 ++++++++++++++++++++++++++++---
 3 files changed, 57 insertions(+), 4 deletions(-)
 create mode 100644 homework5/Graph.h

diff --git a/homework5/CMakeLists.txt b/homework5/CMakeLists.txt
index 63bbd65..463eb54 100644
--- a/homework5/CMakeLists.txt
+++ b/homework5/CMakeLists.txt
@@ -3,4 +3,5 @@ project(homework5)
 
 set(CMAKE_CXX_STANDARD 20)
 
-add_executable(test1 test1.cpp)
+add_executable(test1 test1.cpp
+        Graph.h)
diff --git a/homework5/Graph.h b/homework5/Graph.h
new file mode 100644
index 0000000..5ba9cd7
--- /dev/null
+++ b/homework5/Graph.h
@@ -0,0 +1,27 @@
+//
+// Created by 31416 on 24-12-4.
+//
+
+#ifndef GRAPH_H
+#define GRAPH_H
+
+#include<vector>
+using namespace std;
+
+template<typename T>
+class Graph {
+private:
+    vector<int> ids;
+    Graph *node;
+    int max_id;
+
+public:
+    Graph() {
+        ids.clear();
+        node = NULL;
+        max_id = 0;
+    }
+};
+
+
+#endif //GRAPH_H
diff --git a/homework5/test1.cpp b/homework5/test1.cpp
index b96e94a..5ada9d0 100644
--- a/homework5/test1.cpp
+++ b/homework5/test1.cpp
@@ -1,3 +1,28 @@
-//
-// Created by 31416 on 24-12-4.
-//
+// 利用邻接矩阵存储无向图，并从0号顶点开始进行深度优先遍历。
+// 输入：
+// 输入第一行是两个整数n e，其中n表示顶点数（则顶点编号为0至n-1），e表示图中的边数。之后有e行信息输入，每行输入表示一条边，格式是“顶点1 顶点2”，把边插入图中。如：
+// 4  4
+// 0  1
+// 1  3
+// 0  3
+// 0  2
+// 输出：
+// 先输出存储图的邻接矩阵，同一行元素之间空1格，最后一个元素之后不要有空格。
+// 之后空一行后输出从0号顶点开始的深度优先遍历序列，顶点编号之间空1格。
+// 例如，对于上面的示例输入，输出为：
+// 0 1 1 1
+// 1 0 0 1
+// 1 0 0 0
+// 1 1 0 0
+// 从顶点0开始的深度优先遍历序列：
+// 0 1 3 2
+// 说明
+// 输入第1个4表示有4个顶点，第2个4表示有4条边。之后的4行输入代表4条边的顶点。
+// 输出的前4行为邻接矩阵，之后空一行，然后输出的“0 1 3 2”是深度优先遍历序列。
+
+# include "Graph.h"
+#include<iostream>
+using namespace std;
+
+int main() {
+}