mirror of
https://github.com/krahets/hello-algo.git
synced 2024-12-26 11:16:28 +08:00
e720aa2d24
* Sync recent changes to the revised Word. * Revised the preface chapter * Revised the introduction chapter * Revised the computation complexity chapter * Revised the chapter data structure * Revised the chapter array and linked list * Revised the chapter stack and queue * Revised the chapter hashing * Revised the chapter tree * Revised the chapter heap * Revised the chapter graph * Revised the chapter searching * Reivised the sorting chapter * Revised the divide and conquer chapter * Revised the chapter backtacking * Revised the DP chapter * Revised the greedy chapter * Revised the appendix chapter * Revised the preface chapter doubly * Revised the figures
132 lines
3.5 KiB
JavaScript
132 lines
3.5 KiB
JavaScript
/**
|
||
* File: graph_adjacency_matrix.js
|
||
* Created Time: 2023-02-09
|
||
* Author: Zhuo Qinyue (1403450829@qq.com)
|
||
*/
|
||
|
||
/* 基于邻接矩阵实现的无向图类 */
|
||
class GraphAdjMat {
|
||
vertices; // 顶点列表，元素代表“顶点值”，索引代表“顶点索引”
|
||
adjMat; // 邻接矩阵，行列索引对应“顶点索引”
|
||
|
||
/* 构造函数 */
|
||
constructor(vertices, edges) {
|
||
this.vertices = [];
|
||
this.adjMat = [];
|
||
// 添加顶点
|
||
for (const val of vertices) {
|
||
this.addVertex(val);
|
||
}
|
||
// 添加边
|
||
// 请注意，edges 元素代表顶点索引，即对应 vertices 元素索引
|
||
for (const e of edges) {
|
||
this.addEdge(e[0], e[1]);
|
||
}
|
||
}
|
||
|
||
/* 获取顶点数量 */
|
||
size() {
|
||
return this.vertices.length;
|
||
}
|
||
|
||
/* 添加顶点 */
|
||
addVertex(val) {
|
||
const n = this.size();
|
||
// 向顶点列表中添加新顶点的值
|
||
this.vertices.push(val);
|
||
// 在邻接矩阵中添加一行
|
||
const newRow = [];
|
||
for (let j = 0; j < n; j++) {
|
||
newRow.push(0);
|
||
}
|
||
this.adjMat.push(newRow);
|
||
// 在邻接矩阵中添加一列
|
||
for (const row of this.adjMat) {
|
||
row.push(0);
|
||
}
|
||
}
|
||
|
||
/* 删除顶点 */
|
||
removeVertex(index) {
|
||
if (index >= this.size()) {
|
||
throw new RangeError('Index Out Of Bounds Exception');
|
||
}
|
||
// 在顶点列表中移除索引 index 的顶点
|
||
this.vertices.splice(index, 1);
|
||
|
||
// 在邻接矩阵中删除索引 index 的行
|
||
this.adjMat.splice(index, 1);
|
||
// 在邻接矩阵中删除索引 index 的列
|
||
for (const row of this.adjMat) {
|
||
row.splice(index, 1);
|
||
}
|
||
}
|
||
|
||
/* 添加边 */
|
||
// 参数 i, j 对应 vertices 元素索引
|
||
addEdge(i, j) {
|
||
// 索引越界与相等处理
|
||
if (i < 0 || j < 0 || i >= this.size() || j >= this.size() || i === j) {
|
||
throw new RangeError('Index Out Of Bounds Exception');
|
||
}
|
||
// 在无向图中，邻接矩阵关于主对角线对称，即满足 (i, j) === (j, i)
|
||
this.adjMat[i][j] = 1;
|
||
this.adjMat[j][i] = 1;
|
||
}
|
||
|
||
/* 删除边 */
|
||
// 参数 i, j 对应 vertices 元素索引
|
||
removeEdge(i, j) {
|
||
// 索引越界与相等处理
|
||
if (i < 0 || j < 0 || i >= this.size() || j >= this.size() || i === j) {
|
||
throw new RangeError('Index Out Of Bounds Exception');
|
||
}
|
||
this.adjMat[i][j] = 0;
|
||
this.adjMat[j][i] = 0;
|
||
}
|
||
|
||
/* 打印邻接矩阵 */
|
||
print() {
|
||
console.log('顶点列表 = ', this.vertices);
|
||
console.log('邻接矩阵 =', this.adjMat);
|
||
}
|
||
}
|
||
|
||
/* Driver Code */
|
||
/* 初始化无向图 */
|
||
// 请注意，edges 元素代表顶点索引，即对应 vertices 元素索引
|
||
const vertices = [1, 3, 2, 5, 4];
|
||
const edges = [
|
||
[0, 1],
|
||
[1, 2],
|
||
[2, 3],
|
||
[0, 3],
|
||
[2, 4],
|
||
[3, 4],
|
||
];
|
||
const graph = new GraphAdjMat(vertices, edges);
|
||
console.log('\n初始化后，图为');
|
||
graph.print();
|
||
|
||
/* 添加边 */
|
||
// 顶点 1, 2 的索引分别为 0, 2
|
||
graph.addEdge(0, 2);
|
||
console.log('\n添加边 1-2 后，图为');
|
||
graph.print();
|
||
|
||
/* 删除边 */
|
||
// 顶点 1, 3 的索引分别为 0, 1
|
||
graph.removeEdge(0, 1);
|
||
console.log('\n删除边 1-3 后，图为');
|
||
graph.print();
|
||
|
||
/* 添加顶点 */
|
||
graph.addVertex(6);
|
||
console.log('\n添加顶点 6 后，图为');
|
||
graph.print();
|
||
|
||
/* 删除顶点 */
|
||
// 顶点 3 的索引为 1
|
||
graph.removeVertex(1);
|
||
console.log('\n删除顶点 3 后，图为');
|
||
graph.print();
|