开一个新单元，感觉蛮重要的
偷偷制造
打赏偷偷：[置顶]⬆️修考使用必看🔥
1️⃣数据结构与算法：
1.Bellman-Ford algorithm:
The Bellman-Ford algorithm is a method for finding the shortest path from a single source vertex to all other vertices in a directed weighted graph. Although it is slower than Dijkstra’s algorithm for the same problem, it is more flexible because it can handle graphs with negative edge weights and it can detect negative circles.
The Bellman–Ford algorithm simply relaxes all the edges, and does this 
🔑关键词：单源最短路、松弛、负权边、负权环
2.Dijkstra's algorithm:
Dijkstra’s algorithm is a solution to the single-source shortest path problem, and its implementation principle is mainly based on greedy algorithm and priority queue. Create a priority queue and put all vertices into the priority queue. The priority queue is sorted according to the shortest path distance of the vertices.If a priority queue (such as a binary heap) is used to select the vertex with the smallest distance, then the time complexity can be optimized to O((V+E)logV)
🔑关键词：单源最短路、贪心、优先队列
2️⃣操作系统：
3️⃣计算机组成：
4️⃣形式言语与自动机：
5️⃣言语理论：
6️⃣机器学习：
7️⃣数字电路：
8️⃣计算机网络：
9️⃣密码学：
1️⃣0️⃣信号处理：
1.Aliasing(混叠)：
2.Quantization Error（量子化誤差｜量化噪声）：
1️⃣1️⃣控制理论：
1️⃣2️⃣软件开发：
1️⃣3️⃣计算机图形学：
1️⃣4️⃣机器人：