'commit'

2025-08-30 18:35:01 +08:00
commit 1f397eca87
6258 changed files with 1487241 additions and 0 deletions
--- a/C++课程/待整理知识/最短路径/Dijkstra.cpp
+++ b/C++课程/待整理知识/最短路径/Dijkstra.cpp
@@ -0,0 +1,64 @@
+#include<iostream>
+using namespace std;
+int main()
+{
+	// dev<65><76><EFBFBD>뿽<EFBFBD><EBBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ľ<EFBFBD><C4BD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
+	// .cpp<70>ļ<EFBFBD><C4BC>ü<EFBFBD><C3BC>±<EFBFBD><C2B1>򿪣<EFBFBD><F2BFAAA3>ٿ<EFBFBD><D9BF><EFBFBD> 
+	//<2F>ƺ<EFBFBD>ע<EFBFBD><D7A2> 
+	int e[10][10], dis[10], book[10], i, j, n, m, t1, t2, t3, u, v, min;
+	int inf = 99999999; 
+	cin >> n >> m;
+	for (i = 1; i <= n; i++)
+		for (j = 1; j <= n; j++)
+		{
+			if (i == j) {
+				e[i][j] = 0;
+			} 
+			else {
+				e[i][j] = inf;
+			}
+		}
+	for (i = 1; i <= m; i++)
+	{
+		cin >> t1 >> t2 >> t3;
+		e[t1][t2] = t3;
+	}
+	for (i = 1; i <= n; i++)
+	{
+		dis[i] = e[1][i];
+	}
+	for (i = 1; i <= n; i++)
+	{
+		book[i] = 0;
+	}	
+	book[1] = 1;
+	
+
+	for (i = 1; i <= n - 1; i++)
+	{
+		min = inf;
+		for (j = 1; j <= n; j++)
+		{
+			if (book[j] == 0 && dis[j] < min)
+			{
+				min = dis[j];
+				u = j;
+			}
+		}
+
+		book[u] = 1;
+		for (v = 1; v <= n; v++)
+		{
+			if (e[u][v] < inf)
+			{
+				if (dis[v] > dis[u] + e[u][v])
+				{
+					dis[v] = dis[u] + e[u][v];
+				}
+			}
+		}
+	}
+	for (i = 1; i <= n; i++)
+		cout << dis[i] << " ";
+	return 0;
+}
--- a/C++课程/待整理知识/最短路径/Floyd.cpp
+++ b/C++课程/待整理知识/最短路径/Floyd.cpp
@@ -0,0 +1,53 @@
+#include<iostream>
+#include <iomanip>
+using namespace std;
+int main()
+{
+	//最短路径之Floyd算法
+	//https://www.cnblogs.com/GumpYan/p/5540549.html
+
+	int e[10][10], k, i, j, n, m, t1, t2, t3;
+	//用inf(infinity的缩写)存储一个我们认为的正无穷值
+	int inf = 99999999;
+	//读入n和m，n表示顶点个数，m表示边的条数
+	cin >> n >> m;
+	//初始化
+	for (i = 1; i <= n; i++)
+		for (j = 1; j <= n; j++)
+		{
+			if (i == j) {
+				e[i][j] = 0;
+			}
+			else {
+				e[i][j] = inf;
+			}
+		}
+
+	//读入边
+	for (i = 1; i <= m; i++)
+	{
+		cin >> t1 >> t2 >> t3;
+		e[t1][t2] = t3;
+	}
+
+	//Floyd-Warshall算法核心语句
+	for (k = 1; k <= n; k++)
+		for (i = 1; i <= n; i++)
+			for (j = 1; j <= n; j++)
+			{
+				if (e[i][j] > e[i][k] + e[k][j])
+				{
+					e[i][j] = e[i][k] + e[k][j];
+				}
+			}
+	//输出最终的结果
+	for (i = 1; i <= n; i++)
+	{
+		for (j = 1; j <= n; j++)
+		{
+			cout << setw(10) << e[i][j];
+		}
+		cout << endl;
+	}
+	return 0;
+}