グラフとBFS(幅優先探索)・DFS(深さ優先探索)をJSで実装してみる - Qiita

class Graph { constructor() { this.connectedList = {}; } addVertex(vertex) { this.connectedList[vertex] = [] } addEdge(v1, v2) { this.connectedList[v1].push(v2); this.connectedList[v2].push(v1); } removeEdge(vertex1, vertex2) { this.connectedList[vertex1] = this.connectedList[vertex1].filter( v => v !== vertex2 ); this.connectedList[vertex2] = this.connectedList[vertex2].filter( v => v !== vertex1