mirror of
https://github.com/krahets/hello-algo.git
synced 2024-12-27 10:36:28 +08:00
567497a6b8
* feat(codes/cpp): Add cmake build method * feat(codes/cpp): Modify the cpp support version to c++17 * feat(codes/cpp): fix graph_adjacency_list.cpp cannot be compiled into an executable * style(codes/cpp): Adjust the code to enhance compatibility. * feat(codes/cpp): Change cpp version from 17 to 11.
87 lines
2.6 KiB
C++
87 lines
2.6 KiB
C++
/**
|
||
* File: graph_adjacency_list.cpp
|
||
* Created Time: 2023-02-09
|
||
* Author: what-is-me (whatisme@outlook.jp), Krahets (krahets@163.com)
|
||
*/
|
||
|
||
#include "../include/include.hpp"
|
||
|
||
/* 基于邻接表实现的无向图类 */
|
||
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) {
|
||
vec.erase(vec.begin() + i);
|
||
break;
|
||
}
|
||
}
|
||
}
|
||
|
||
/* 构造方法 */
|
||
GraphAdjList(const vector<vector<Vertex*>>& edges) {
|
||
// 添加所有顶点和边
|
||
for (const vector<Vertex*>& edge : edges) {
|
||
addVertex(edge[0]);
|
||
addVertex(edge[1]);
|
||
addEdge(edge[0], edge[1]);
|
||
}
|
||
}
|
||
|
||
/* 获取顶点数量 */
|
||
int size() { return adjList.size(); }
|
||
|
||
/* 添加边 */
|
||
void addEdge(Vertex* vet1, Vertex* vet2) {
|
||
if (!adjList.count(vet1) || !adjList.count(vet2) || vet1 == vet2)
|
||
throw invalid_argument("不存在顶点");
|
||
// 添加边 vet1 - vet2
|
||
adjList[vet1].push_back(vet2);
|
||
adjList[vet2].push_back(vet1);
|
||
}
|
||
|
||
/* 删除边 */
|
||
void removeEdge(Vertex* vet1, Vertex* vet2) {
|
||
if (!adjList.count(vet1) || !adjList.count(vet2) || vet1 == vet2)
|
||
throw invalid_argument("不存在顶点");
|
||
// 删除边 vet1 - vet2
|
||
remove(adjList[vet1], vet2);
|
||
remove(adjList[vet2], vet1);
|
||
}
|
||
|
||
/* 添加顶点 */
|
||
void addVertex(Vertex* vet) {
|
||
if (adjList.count(vet)) return;
|
||
// 在邻接表中添加一个新链表
|
||
adjList[vet] = vector<Vertex*>();
|
||
}
|
||
|
||
/* 删除顶点 */
|
||
void removeVertex(Vertex* vet) {
|
||
if (!adjList.count(vet))
|
||
throw invalid_argument("不存在顶点");
|
||
// 在邻接表中删除顶点 vet 对应的链表
|
||
adjList.erase(vet);
|
||
// 遍历其它顶点的链表，删除所有包含 vet 的边
|
||
for (auto& [key, vec] : adjList) {
|
||
remove(vec, vet);
|
||
}
|
||
}
|
||
|
||
/* 打印邻接表 */
|
||
void print() {
|
||
cout << "邻接表 =" << endl;
|
||
for (auto& adj : adjList) {
|
||
const auto& key= adj.first;
|
||
const auto& vec = adj.second;
|
||
cout << key->val << ": ";
|
||
PrintUtil::printVector(vetsToVals(vec));
|
||
}
|
||
}
|
||
};
|
||
|
||
// GraphAdjList 的测试样例在 graph_adjacency_list_test.cpp 文件中
|