algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-12-16 03:59:18 +08:00
Code Issues Packages Projects Releases Wiki Activity

Polish the chapter of heap, introduction, preface.

Browse Source 
Replace "其它" with "其他"
This commit is contained in:
krahets
2023-04-09 19:12:37 +08:00
parent 10e2180013
commit 0bec52d7cc
29 changed files with 185 additions and 161 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -7,15 +7,19 @@
#include "../include/include.hpp"
/* 基于邻接表实现的无向图类 */
class GraphAdjList {
class GraphAdjList
{
public:
// 邻接表，key: 顶点，value：该顶点的所有邻接顶点
unordered_map<Vertex*, vector<Vertex*>> adjList;
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;
}
@@ -23,9 +27,11 @@ 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]);
@@ -36,7 +42,8 @@ public:
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
@@ -45,7 +52,8 @@ 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
@@ -54,30 +62,36 @@ public:
}
/* 添加顶点 */
void addVertex(Vertex* vet) {
if (adjList.count(vet)) return;
void addVertex(Vertex *vet)
{
if (adjList.count(vet))
return;
// 在邻接表中添加一个新链表
adjList[vet] = vector<Vertex*>();
adjList[vet] = vector<Vertex *>();
}
/* 删除顶点 */
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) {
// 遍历其他顶点的链表，删除所有包含 vet 的边
for (auto &[key, vec] : adjList)
{
remove(vec, vet);
}
}
/* 打印邻接表 */
void print() {
void print()
{
cout << "邻接表 =" << endl;
for (auto& adj : adjList) {
const auto& key= adj.first;
const auto& vec = adj.second;
for (auto &adj : adjList)
{
const auto &key = adj.first;
const auto &vec = adj.second;
cout << key->val << ": ";
PrintUtil::printVector(vetsToVals(vec));
}