Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Add vertex class for javascript and typescript #370

Merged
merged 6 commits into from
Feb 21, 2023
Merged

Add vertex class for javascript and typescript #370

Show file tree
Hide file tree
Changes from 5 commits
Commits
Show all changes
6 commits
Select commit Hold shift + click to select a range
9a64ccd
add vertex class for javascript and typescript
Feb 15, 2023
a7b5e74
Merge branch 'krahets:main' into main
zhuoqinyue Feb 16, 2023
73d7454
update the adjacencyList
Feb 16, 2023
86fa9a3
Merge branch 'main' of https://github.com/zhuoqinyue/hello-algo
Feb 16, 2023
1a900a1
update the graph_adjacency_list file
Feb 18, 2023
e2d4059
update the implicit type
Feb 19, 2023
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
104 changes: 54 additions & 50 deletions codes/javascript/chapter_graph/graph_adjacency_list.js
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -4,13 +4,7 @@
* Author: Justin (xiefahit@gmail.com)
*/

/* 顶点类 */
class Vertex {
val;
constructor(val) {
this.val = val;
}
}
const { Vertex } = require('../include/Vertex')

/* 基于邻接表实现的无向图类 */
class GraphAdjList {
Expand Down Expand Up @@ -40,8 +34,8 @@ class GraphAdjList {
throw new Error("Illegal Argument Exception");
}
// 添加边 vet1 - vet2
this.adjList.get(vet1).add(vet2);
this.adjList.get(vet2).add(vet1);
this.adjList.get(vet1).push(vet2);
this.adjList.get(vet2).push(vet1);
}

/* 删除边 */
Expand All @@ -50,15 +44,15 @@ class GraphAdjList {
throw new Error("Illegal Argument Exception");
}
// 删除边 vet1 - vet2
this.adjList.get(vet1).delete(vet2);
this.adjList.get(vet2).delete(vet1);
this.adjList.get(vet1).splice(this.adjList.get(vet1).indexOf(vet2), 1);
this.adjList.get(vet2).splice(this.adjList.get(vet2).indexOf(vet1), 1);
}

/* 添加顶点 */
addVertex(vet) {
if (this.adjList.has(vet)) return;
// 在邻接表中添加一个新链表
this.adjList.set(vet, new Set());
this.adjList.set(vet, []);
}

/* 删除顶点 */
Expand All @@ -70,7 +64,10 @@ class GraphAdjList {
this.adjList.delete(vet);
// 遍历其它顶点的链表，删除所有包含 vet 的边
for (let set of this.adjList.values()) {
set.delete(vet);
const index = set.indexOf(vet);
if (index > -1) {
set.splice(index, 1);
}
}
}

Expand All @@ -79,46 +76,53 @@ class GraphAdjList {
console.log("邻接表 =");
for (const [key, value] of this.adjList) {
const tmp = [];
for (const vertex of value){
for (const vertex of value) {
tmp.push(vertex.val);
}
console.log(key.val + ": " + tmp + ",");
console.log(key.val + ": " + tmp.join());
}
}
}

/* Driver Code */
/* 初始化无向图 */
const v0 = new Vertex(1),
v1 = new Vertex(3),
v2 = new Vertex(2),
v3 = new Vertex(5),
v4 = new Vertex(4);
const edges = [[v0, v1], [v1, v2], [v2, v3], [v0, v3], [v2, v4], [v3, v4]];
const graph = new GraphAdjList(edges);
console.log("\n初始化后，图为");
graph.print();

/* 添加边 */
// 顶点 1, 2 即 v0, v2
graph.addEdge(v0, v2);
console.log("\n添加边 1-2 后，图为");
graph.print();

/* 删除边 */
// 顶点 1, 3 即 v0, v1
graph.removeEdge(v0, v1);
console.log("\n删除边 1-3 后，图为");
graph.print();

/* 添加顶点 */
const v5 = new Vertex(6);
graph.addVertex(v5);
console.log("\n添加顶点 6 后，图为");
graph.print();

/* 删除顶点 */
// 顶点 3 即 v1
graph.removeVertex(v1);
console.log("\n删除顶点 3 后，图为");
graph.print();
if (require.main === module) {
/* Driver Code */
/* 初始化无向图 */
const v0 = new Vertex(1),
v1 = new Vertex(3),
v2 = new Vertex(2),
v3 = new Vertex(5),
v4 = new Vertex(4);
const edges = [[v0, v1], [v1, v2], [v2, v3], [v0, v3], [v2, v4], [v3, v4]];
const graph = new GraphAdjList(edges);
console.log("\n初始化后，图为");
graph.print();

/* 添加边 */
// 顶点 1, 2 即 v0, v2
graph.addEdge(v0, v2);
console.log("\n添加边 1-2 后，图为");
graph.print();

/* 删除边 */
// 顶点 1, 3 即 v0, v1
graph.removeEdge(v0, v1);
console.log("\n删除边 1-3 后，图为");
graph.print();

/* 添加顶点 */
const v5 = new Vertex(6);
graph.addVertex(v5);
console.log("\n添加顶点 6 后，图为");
graph.print();

/* 删除顶点 */
// 顶点 3 即 v1
graph.removeVertex(v1);
console.log("\n删除顶点 3 后，图为");
graph.print();

}

module.exports = {
GraphAdjList
};
36 changes: 36 additions & 0 deletions codes/javascript/include/Vertex.js
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,36 @@
/**
* File: Vertex.ts
* Created Time: 2023-02-15
* Author: Zhuo Qinyue (1403450829@qq.com)
*/


/* 顶点类 */
class Vertex {
val;
constructor(val) {
this.val = val;
}

/* 输入值列表 vals ，返回顶点列表 vets */
static valsToVets(vals) {
const vets = [];
for (let i = 0; i < vals.length; i++) {
vets[i] = new Vertex(vals[i]);
}
return vets;
}

/* 输入顶点列表 vets ，返回值列表 vals */
static vetsToVals(vets) {
const vals = [];
for (const vet of vets) {
vals.push(vet.val);
}
return vals;
}
}

module.exports = {
Vertex
};
96 changes: 48 additions & 48 deletions codes/typescript/chapter_graph/graph_adjacency_list.ts
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -4,19 +4,13 @@
* Author: Justin (xiefahit@gmail.com)
*/

/* 顶点类 */
class Vertex {
val: number;
constructor(val: number) {
this.val = val;
}
}
import { Vertex } from "../module/Vertex";

/* 基于邻接表实现的无向图类 */
class GraphAdjList {
// 邻接表，使用哈希表来代替链表，以提升删除边、删除顶点的效率
// 请注意，adjList 中的元素是 Vertex 对象
adjList: Map<Vertex, Set<Vertex>>;
adjList: Map<Vertex, Vertex[]>;

/* 构造方法 */
constructor(edges: Vertex[][]) {
Expand All @@ -40,8 +34,8 @@ class GraphAdjList {
throw new Error("Illegal Argument Exception");
}
// 添加边 vet1 - vet2
this.adjList.get(vet1).add(vet2);
this.adjList.get(vet2).add(vet1);
this.adjList.get(vet1).push(vet2);
this.adjList.get(vet2).push(vet1);
}

/* 删除边 */
Expand All @@ -50,15 +44,15 @@ class GraphAdjList {
throw new Error("Illegal Argument Exception");
}
// 删除边 vet1 - vet2
this.adjList.get(vet1).delete(vet2);
this.adjList.get(vet2).delete(vet1);
this.adjList.get(vet1).splice(this.adjList.get(vet1).indexOf(vet2), 1);
this.adjList.get(vet2).splice(this.adjList.get(vet2).indexOf(vet1), 1);
}

/* 添加顶点 */
addVertex(vet: Vertex): void {
if (this.adjList.has(vet)) return;
// 在邻接表中添加一个新链表
this.adjList.set(vet, new Set());
this.adjList.set(vet, []);
}

/* 删除顶点 */
Expand All @@ -70,7 +64,10 @@ class GraphAdjList {
this.adjList.delete(vet);
// 遍历其它顶点的链表，删除所有包含 vet 的边
for (let set of this.adjList.values()) {
set.delete(vet);
const index: number = set.indexOf(vet);
if (index > -1) {
set.splice(index, 1);
}
}
}

Expand All @@ -79,48 +76,51 @@ class GraphAdjList {
console.log("邻接表 =");
for (const [key, value] of this.adjList.entries()) {
const tmp = [];
for (const vertex of value){
for (const vertex of value) {
tmp.push(vertex.val);
}
console.log(key.val + ": " + tmp + ",");
console.log(key.val + ": " + tmp.join());
}
}
}

/* Driver Code */
/* 初始化无向图 */
const v0 = new Vertex(1),
v1 = new Vertex(3),
v2 = new Vertex(2),
v3 = new Vertex(5),
v4 = new Vertex(4);
const edges = [[v0, v1], [v1, v2], [v2, v3], [v0, v3], [v2, v4], [v3, v4]];
const graph = new GraphAdjList(edges);
console.log("\n初始化后，图为");
graph.print();
// need to add the package @types/node contains type definitions for Node.js, npm i --save-dev @types/node
if (require.main === module) {
/* Driver Code */
/* 初始化无向图 */
const v0 = new Vertex(1),
v1 = new Vertex(3),
v2 = new Vertex(2),
v3 = new Vertex(5),
v4 = new Vertex(4);
const edges: Vertex[][] = [[v0, v1], [v1, v2], [v2, v3], [v0, v3], [v2, v4], [v3, v4]];
zhuoqinyue marked this conversation as resolved.
Show resolved Hide resolved
const graph: GraphAdjList = new GraphAdjList(edges);
zhuoqinyue marked this conversation as resolved.
Show resolved Hide resolved
console.log("\n初始化后，图为");
graph.print();

/* 添加边 */
// 顶点 1, 2 即 v0, v2
graph.addEdge(v0, v2);
console.log("\n添加边 1-2 后，图为");
graph.print();
/* 添加边 */
// 顶点 1, 2 即 v0, v2
graph.addEdge(v0, v2);
console.log("\n添加边 1-2 后，图为");
graph.print();

/* 删除边 */
// 顶点 1, 3 即 v0, v1
graph.removeEdge(v0, v1);
console.log("\n删除边 1-3 后，图为");
graph.print();
/* 删除边 */
// 顶点 1, 3 即 v0, v1
graph.removeEdge(v0, v1);
console.log("\n删除边 1-3 后，图为");
graph.print();

/* 添加顶点 */
const v5 = new Vertex(6);
graph.addVertex(v5);
console.log("\n添加顶点 6 后，图为");
graph.print();
/* 添加顶点 */
const v5: Vertex = new Vertex(6);
zhuoqinyue marked this conversation as resolved.
Show resolved Hide resolved
graph.addVertex(v5);
console.log("\n添加顶点 6 后，图为");
graph.print();

/* 删除顶点 */
// 顶点 3 即 v1
graph.removeVertex(v1);
console.log("\n删除顶点 3 后，图为");
graph.print();
/* 删除顶点 */
// 顶点 3 即 v1
graph.removeVertex(v1);
console.log("\n删除顶点 3 后，图为");
graph.print();
}

export {}
export { GraphAdjList };
34 changes: 34 additions & 0 deletions codes/typescript/module/Vertex.ts
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,34 @@
/**
* File: Vertex.ts
* Created Time: 2023-02-15
* Author: Zhuo Qinyue (1403450829@qq.com)
*/


/* 顶点类 */
class Vertex {
val: number;
constructor(val: number) {
this.val = val;
}

/* 输入值列表 vals ，返回顶点列表 vets */
public static valsToVets(vals: number[]): Vertex[] {
const vets: Vertex[] = [];
for (let i = 0; i < vals.length; i++) {
vets[i] = new Vertex(vals[i]);
}
return vets;
}

/* 输入顶点列表 vets ，返回值列表 vals */
public static vetsToVals(vets: Vertex[]): number[] {
const vals: number[] = [];
for (const vet of vets) {
vals.push(vet.val);
}
return vals;
}
}

export { Vertex };