CS_learn/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-04-05 03:30:30 +08:00
Code Issues Packages Projects Releases Wiki Activity

Format C++ codes in Clang-Format Style: Microsoft

Browse Source
This commit is contained in:
krahets
2023-04-14 03:44:02 +08:00
parent f8513455b5
commit 9c9c8b7574
46 changed files with 732 additions and 888 deletions
Download Patch File Download Diff File Expand all files Collapse all files

49
codes/cpp/chapter_graph/graph_adjacency_list.cpp
View File

@@ -7,19 +7,15 @@
#include "../include/include.hpp"
/* 基于邻接表实现的无向图类 */
class GraphAdjList
{
public:
class GraphAdjList {
public:
// 邻接表，key: 顶点，value：该顶点的所有邻接顶点
unordered_map<Vertex *, vector<Vertex *>> adjList;
/* 在 vector 中删除指定节点 */
void remove(vector<Vertex *> &vec, Vertex *vet)
{
for (int i = 0; i < vec.size(); i++)
{
if (vec[i] == vet)
{
void remove(vector<Vertex *> &vec, Vertex *vet) {
for (int i = 0; i < vec.size(); i++) {
if (vec[i] == vet) {
vec.erase(vec.begin() + i);
break;
}
@@ -27,11 +23,9 @@ public:
}
/* 构造方法 */
GraphAdjList(const vector<vector<Vertex *>> &edges)
{
GraphAdjList(const vector<vector<Vertex *>> &edges) {
// 添加所有顶点和边
for (const vector<Vertex *> &edge : edges)
{
for (const vector<Vertex *> &edge : edges) {
addVertex(edge[0]);
addVertex(edge[1]);
addEdge(edge[0], edge[1]);
@@ -39,11 +33,12 @@ public:
}
/* 获取顶点数量 */
int size() { return adjList.size(); }
int size() {
return adjList.size();
}
/* 添加边 */
void addEdge(Vertex *vet1, Vertex *vet2)
{
void addEdge(Vertex *vet1, Vertex *vet2) {
if (!adjList.count(vet1) || !adjList.count(vet2) || vet1 == vet2)
throw invalid_argument("不存在顶点");
// 添加边 vet1 - vet2
@@ -52,8 +47,7 @@ public:
}
/* 删除边 */
void removeEdge(Vertex *vet1, Vertex *vet2)
{
void removeEdge(Vertex *vet1, Vertex *vet2) {
if (!adjList.count(vet1) || !adjList.count(vet2) || vet1 == vet2)
throw invalid_argument("不存在顶点");
// 删除边 vet1 - vet2
@@ -62,8 +56,7 @@ public:
}
/* 添加顶点 */
void addVertex(Vertex *vet)
{
void addVertex(Vertex *vet) {
if (adjList.count(vet))
return;
// 在邻接表中添加一个新链表
@@ -71,29 +64,25 @@ public:
}
/* 删除顶点 */
void removeVertex(Vertex *vet)
{
void removeVertex(Vertex *vet) {
if (!adjList.count(vet))
throw invalid_argument("不存在顶点");
// 在邻接表中删除顶点 vet 对应的链表
adjList.erase(vet);
// 遍历其他顶点的链表，删除所有包含 vet 的边
for (auto &[key, vec] : adjList)
{
remove(vec, vet);
for (auto &adj : adjList) {
remove(adj.second, vet);
}
}
/* 打印邻接表 */
void print()
{
void print() {
cout << "邻接表 =" << endl;
for (auto &adj : adjList)
{
for (auto &adj : adjList) {
const auto &key = adj.first;
const auto &vec = adj.second;
cout << key->val << ": ";
PrintUtil::printVector(vetsToVals(vec));
printVector(vetsToVals(vec));
}
}
};

8
codes/cpp/chapter_graph/graph_adjacency_list_test.cpp
View File

@@ -9,9 +9,9 @@
/* Driver Code */
int main() {
/* 初始化无向图 */
vector<Vertex*> v = valsToVets(vector<int> { 1, 3, 2, 5, 4 });
vector<vector<Vertex*>> edges = { { v[0], v[1] }, { v[0], v[3] }, { v[1], v[2] },
{ v[2], v[3] }, { v[2], v[4] }, { v[3], v[4] } };
vector<Vertex *> v = valsToVets(vector<int>{1, 3, 2, 5, 4});
vector<vector<Vertex *>> edges = {{v[0], v[1]}, {v[0], v[3]}, {v[1], v[2]},
{v[2], v[3]}, {v[2], v[4]}, {v[3], v[4]}};
GraphAdjList graph(edges);
cout << "\n初始化后，图为" << endl;
graph.print();
@@ -29,7 +29,7 @@ int main() {
graph.print();
/* 添加顶点 */
Vertex* v5 = new Vertex(6);
Vertex *v5 = new Vertex(6);
graph.addVertex(v5);
cout << "\n添加顶点 6 后，图为" << endl;
graph.print();

18
codes/cpp/chapter_graph/graph_adjacency_matrix.cpp
View File

@@ -11,16 +11,16 @@ class GraphAdjMat {
vector<int> vertices; // 顶点列表，元素代表“顶点值”，索引代表“顶点索引”
vector<vector<int>> adjMat; // 邻接矩阵，行列索引对应“顶点索引”
public:
public:
/* 构造方法 */
GraphAdjMat(const vector<int>& vertices, const vector<vector<int>>& edges) {
GraphAdjMat(const vector<int> &vertices, const vector<vector<int>> &edges) {
// 添加顶点
for (int val : vertices) {
addVertex(val);
}
// 添加边
// 请注意，edges 元素代表顶点索引，即对应 vertices 元素索引
for (const vector<int>& edge : edges) {
for (const vector<int> &edge : edges) {
addEdge(edge[0], edge[1]);
}
}
@@ -38,7 +38,7 @@ public:
// 在邻接矩阵中添加一行
adjMat.emplace_back(n, 0);
// 在邻接矩阵中添加一列
for (vector<int>& row : adjMat) {
for (vector<int> &row : adjMat) {
row.push_back(0);
}
}
@@ -53,7 +53,7 @@ public:
// 在邻接矩阵中删除索引 index 的行
adjMat.erase(adjMat.begin() + index);
// 在邻接矩阵中删除索引 index 的列
for (vector<int>& row : adjMat) {
for (vector<int> &row : adjMat) {
row.erase(row.begin() + index);
}
}
@@ -84,9 +84,9 @@ public:
/* 打印邻接矩阵 */
void print() {
cout << "顶点列表 = ";
PrintUtil::printVector(vertices);
printVector(vertices);
cout << "邻接矩阵 =" << endl;
PrintUtil::printVectorMatrix(adjMat);
printVectorMatrix(adjMat);
}
};
@@ -94,8 +94,8 @@ public:
int main() {
/* 初始化无向图 */
// 请注意，edges 元素代表顶点索引，即对应 vertices 元素索引
vector<int> vertices = { 1, 3, 2, 5, 4 };
vector<vector<int>> edges = { { 0, 1 }, { 0, 3 }, { 1, 2 }, { 2, 3 }, { 2, 4 }, { 3, 4 } };
vector<int> vertices = {1, 3, 2, 5, 4};
vector<vector<int>> edges = {{0, 1}, {0, 3}, {1, 2}, {2, 3}, {2, 4}, {3, 4}};
GraphAdjMat graph(vertices, edges);
cout << "\n初始化后，图为" << endl;
graph.print();

24
codes/cpp/chapter_graph/graph_bfs.cpp
View File

@@ -9,13 +9,13 @@
/* 广度优先遍历 BFS */
// 使用邻接表来表示图，以便获取指定顶点的所有邻接顶点
vector<Vertex*> graphBFS(GraphAdjList &graph, Vertex *startVet) {
vector<Vertex *> graphBFS(GraphAdjList &graph, Vertex *startVet) {
// 顶点遍历序列
vector<Vertex*> res;
vector<Vertex *> res;
// 哈希表，用于记录已被访问过的顶点
unordered_set<Vertex*> visited = { startVet };
unordered_set<Vertex *> visited = {startVet};
// 队列用于实现 BFS
queue<Vertex*> que;
queue<Vertex *> que;
que.push(startVet);
// 以顶点 vet 为起点，循环直至访问完所有顶点
while (!que.empty()) {
@@ -25,8 +25,8 @@ vector<Vertex*> graphBFS(GraphAdjList &graph, Vertex *startVet) {
// 遍历该顶点的所有邻接顶点
for (auto adjVet : graph.adjList[vet]) {
if (visited.count(adjVet))
continue; // 跳过已被访问过的顶点
que.push(adjVet); // 只入队未访问的顶点
continue; // 跳过已被访问过的顶点
que.push(adjVet); // 只入队未访问的顶点
visited.emplace(adjVet); // 标记该顶点已被访问
}
}
@@ -37,18 +37,18 @@ vector<Vertex*> graphBFS(GraphAdjList &graph, Vertex *startVet) {
/* Driver Code */
int main() {
/* 初始化无向图 */
vector<Vertex*> v = valsToVets({ 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 });
vector<vector<Vertex*>> edges = { { v[0], v[1] }, { v[0], v[3] }, { v[1], v[2] }, { v[1], v[4] },
{ v[2], v[5] }, { v[3], v[4] }, { v[3], v[6] }, { v[4], v[5] },
{ v[4], v[7] }, { v[5], v[8] }, { v[6], v[7] }, { v[7], v[8] } };
vector<Vertex *> v = valsToVets({0, 1, 2, 3, 4, 5, 6, 7, 8, 9});
vector<vector<Vertex *>> edges = {{v[0], v[1]}, {v[0], v[3]}, {v[1], v[2]}, {v[1], v[4]},
{v[2], v[5]}, {v[3], v[4]}, {v[3], v[6]}, {v[4], v[5]},
{v[4], v[7]}, {v[5], v[8]}, {v[6], v[7]}, {v[7], v[8]}};
GraphAdjList graph(edges);
cout << "\n初始化后，图为\\n";
graph.print();
/* 广度优先遍历 BFS */
vector<Vertex*> res = graphBFS(graph, v[0]);
vector<Vertex *> res = graphBFS(graph, v[0]);
cout << "\n广度优先遍历（BFS）顶点序列为" << endl;
PrintUtil::printVector(vetsToVals(res));
printVector(vetsToVals(res));
// 释放内存
for (Vertex *vet : v) {

22
codes/cpp/chapter_graph/graph_dfs.cpp
View File

@@ -8,13 +8,13 @@
#include "./graph_adjacency_list.cpp"
/* 深度优先遍历 DFS 辅助函数 */
void dfs(GraphAdjList& graph, unordered_set<Vertex*>& visited, vector<Vertex*>& res, Vertex* vet) {
void dfs(GraphAdjList &graph, unordered_set<Vertex *> &visited, vector<Vertex *> &res, Vertex *vet) {
res.push_back(vet); // 记录访问顶点
visited.emplace(vet); // 标记该顶点已被访问
// 遍历该顶点的所有邻接顶点
for (Vertex* adjVet : graph.adjList[vet]) {
for (Vertex *adjVet : graph.adjList[vet]) {
if (visited.count(adjVet))
continue; // 跳过已被访问过的顶点
continue; // 跳过已被访问过的顶点
// 递归访问邻接顶点
dfs(graph, visited, res, adjVet);
}
@@ -22,11 +22,11 @@ void dfs(GraphAdjList& graph, unordered_set<Vertex*>& visited, vector<Vertex*>&
/* 深度优先遍历 DFS */
// 使用邻接表来表示图，以便获取指定顶点的所有邻接顶点
vector<Vertex*> graphDFS(GraphAdjList& graph, Vertex* startVet) {
vector<Vertex *> graphDFS(GraphAdjList &graph, Vertex *startVet) {
// 顶点遍历序列
vector<Vertex*> res;
vector<Vertex *> res;
// 哈希表，用于记录已被访问过的顶点
unordered_set<Vertex*> visited;
unordered_set<Vertex *> visited;
dfs(graph, visited, res, startVet);
return res;
}
@@ -34,17 +34,17 @@ vector<Vertex*> graphDFS(GraphAdjList& graph, Vertex* startVet) {
/* Driver Code */
int main() {
/* 初始化无向图 */
vector<Vertex*> v = valsToVets(vector<int> { 0, 1, 2, 3, 4, 5, 6 });
vector<vector<Vertex*>> edges = { { v[0], v[1] }, { v[0], v[3] }, { v[1], v[2] },
{ v[2], v[5] }, { v[4], v[5] }, { v[5], v[6] } };
vector<Vertex *> v = valsToVets(vector<int>{0, 1, 2, 3, 4, 5, 6});
vector<vector<Vertex *>> edges = {{v[0], v[1]}, {v[0], v[3]}, {v[1], v[2]},
{v[2], v[5]}, {v[4], v[5]}, {v[5], v[6]}};
GraphAdjList graph(edges);
cout << "\n初始化后，图为" << endl;
graph.print();
/* 深度优先遍历 DFS */
vector<Vertex*> res = graphDFS(graph, v[0]);
vector<Vertex *> res = graphDFS(graph, v[0]);
cout << "\n深度优先遍历（DFS）顶点序列为" << endl;
PrintUtil::printVector(vetsToVals(res));
printVector(vetsToVals(res));
// 释放内存
for (Vertex *vet : v) {