Graph Implementation
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768
//Edge List
const graph = [[0,2],[2,3],[2,1],[1,3]];
//Adjacent List
const graph1 = [[2],[2,3],[0,1,3],[1,2]];
//Adjacent Matrix
const graph3 = {
0: [0,0,1,0],
1: [0,0,1,1],
2: [1,1,0,1],
3: [0,1,1,0]
}
class Graph{
constructor (){
this.numberOfNodes = 0;
this.adjacentList = {
};
}
addVertex(node){
this.adjacentList[node] = [];
this.numberOfNodes++;
}
addEdge (node1, node2){
//undirected Graph
this.adjacentList[node1].push(node2);
this.adjacentList[node2].push(node1);
}
showConnections(){
}
}
const myGraph = new Graph();
myGraph.addVertex('0');
myGraph.addVertex('1');
myGraph.addVertex('2');
myGraph.addVertex('3');
myGraph.addVertex('4');
myGraph.addVertex('5');
myGraph.addVertex('6');
myGraph.addEdge('3','1')
myGraph.addEdge('3','4')
myGraph.addEdge('4','2')
myGraph.addEdge('4','5')
myGraph.addEdge('1','2')
myGraph.addEdge('1','0')
myGraph.addEdge('0','2')
myGraph.addEdge('6','5')
console.log(myGraph);
//myGraph.showConnections();
//Answer
// 0 => 1 2
// 1 => 3 2 0
// 2 => 4 1 0
// 3 => 1 4
// 4 => 3 2 5
// 5 => 4 6
// 6 => 5
JavaScript
INFO