File tree Expand file tree Collapse file tree
Expand file tree Collapse file tree Original file line number Diff line number Diff line change @@ -22,4 +22,4 @@ add_executable(AndroidHelper src/main.cpp
2222 src/practice/fuctors/FunctorsTest.cpp src/practice/fuctors/FunctorsTest.h
2323 src/practice/fuctors/funadap.cpp src/practice/fuctors/funadap.h
2424 src/practice/strings/strgst1.cpp src/practice/strings/strgst1.h
25- src/practice/lists/listrmv.cpp src/practice/lists/listrmv.h src/practice/alogs/usealgo.cpp src/practice/alogs/usealgo.h src/practice/arrays/valvect.cpp src/practice/arrays/valvect.h src/practice/lists/ilist.cpp src/practice/lists/ilist.h src/practice/mmap/mmap_demo.cpp src/practice/mmap/mmap_demo.h )
25+ src/practice/lists/listrmv.cpp src/practice/lists/listrmv.h src/practice/alogs/usealgo.cpp src/practice/alogs/usealgo.h src/practice/arrays/valvect.cpp src/practice/arrays/valvect.h src/practice/lists/ilist.cpp src/practice/lists/ilist.h src/practice/mmap/mmap_demo.cpp src/practice/mmap/mmap_demo.h src/datastruct/Graph.cpp src/datastruct/Graph.h )
Original file line number Diff line number Diff line change 1+ //
2+ // Created by 赵健 on 2021/10/20.
3+ //
4+
5+ #include " Graph.h"
6+ #include < iostream>
7+
8+ using namespace std ;
9+
10+ Status Graph::CreateUDN (AMGraph &G) {
11+ // 采用邻接矩阵表示法,创建无向网G
12+ cin>>G.vexnum >>G.arcnum ; // 输入总顶点数,总边数
13+ int i,j,k,v1,v2,w;
14+ for (i=0 ; i<G.vexnum ; ++i){ // 依次输入点的信息
15+ cin>>G.vexs [i];
16+ }
17+ // 初始化邻接矩阵,边的权值均置为极大值MaxInt
18+ for (i=0 ; G.vexnum ;++i) {
19+ for (j=0 ; G.vexnum ;++j) {
20+ G.arcs [i][j] = MaxInt;
21+ }
22+ }
23+ // 构造邻接矩阵
24+ for (k=0 ; k<G.arcnum ;++k) {
25+ cin>>v1>>v2>>w;
26+ }
27+ return OK ;
28+ }
Original file line number Diff line number Diff line change 1+ //
2+ // Created by 赵健 on 2021/10/20.
3+ //
4+
5+ #ifndef ANDROIDHELPER_GRAPH_H
6+ #define ANDROIDHELPER_GRAPH_H
7+
8+ #define MaxInt 32767 // 表示极大值,即∞
9+ #define MVNum 100 // 最大顶点数
10+ #define OK 1
11+
12+ typedef char VerTexType; // 假设顶点的数据类型为字符型
13+ typedef int ArcType; // 假设边的权值类型为整形
14+ typedef int Status; // 返回的状态
15+
16+ typedef struct {
17+ VerTexType vexs[MVNum]; // 顶点表
18+ ArcType arcs[MVNum][MVNum];// 邻接矩阵
19+ int vexnum, arcnum; // 图的当前点数和边数
20+ } AMGraph;
21+
22+ class Graph {
23+ public:
24+ Status CreateUDN (AMGraph &);// 创建邻接矩阵
25+ };
26+
27+
28+ #endif // ANDROIDHELPER_GRAPH_H
You can’t perform that action at this time.
0 commit comments