mirror of
https://github.com/TheAlgorithms/JavaScript.git
synced 2025-07-20 18:43:43 +08:00
45 lines
860 B
JavaScript
45 lines
860 B
JavaScript
class Graph {
|
|
constructor () {
|
|
this.adjacencyMap = {}
|
|
}
|
|
|
|
addVertex (v) {
|
|
this.adjacencyMap[v] = []
|
|
}
|
|
|
|
containsVertex (vertex) {
|
|
return typeof (this.adjacencyMap[vertex]) !== 'undefined'
|
|
}
|
|
|
|
addEdge (v, w) {
|
|
let result = false
|
|
if (this.containsVertex(v) && this.containsVertex(w)) {
|
|
this.adjacencyMap[v].push(w)
|
|
this.adjacencyMap[w].push(v)
|
|
result = true
|
|
}
|
|
return result
|
|
}
|
|
|
|
printGraph () {
|
|
const keys = Object.keys(this.adjacencyMap)
|
|
for (const i of keys) {
|
|
const values = this.adjacencyMap[i]
|
|
let vertex = ''
|
|
for (const j of values) { vertex += j + ' ' }
|
|
console.log(i + ' -> ' + vertex)
|
|
}
|
|
}
|
|
}
|
|
|
|
const example = () => {
|
|
const g = new Graph()
|
|
g.addVertex(1)
|
|
g.addVertex(2)
|
|
g.addVertex(3)
|
|
g.addEdge(1, 2)
|
|
g.addEdge(1, 3)
|
|
g.printGraph()
|
|
}
|
|
example()
|