dataStructuresWithJavaScript/undirected graph.js at main · Sainath1998/dataStructuresWithJavaScript · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
//adding edges and vertices to the graphs
function undirectedGraph()
{
    this.edges= {};
}

//adding vertices to the graphs

undirectedGraph.prototype.addVertex = function(vertex)
{
    this.edges[vertex] = {};
}

//adding weighted edges to the graphs
undirectedGraph.prototype.addEdge = function(vertex1,vertex2,weight)
{
    if(weight == undefined)
    {
        weight = 0;
    }
    this.edges[vertex1][vertex2] = weight;
    this.edges[vertex2][vertex1] = weight;
}
var graph1 = new undirectedGraph();
graph1.addVertex(1);
graph1.addVertex(2);
graph1.addVertex(3);
graph1.addEdge(1,2,1);
console.log(graph1.edges);
graph1.addVertex(4);
graph1.addVertex(5);
graph1.addVertex(6);
graph1.addEdge(2,3,8);
graph1.addEdge(4,5,100);
graph1.addEdge(1,5,88);
console.log(graph1.edges)
undirectedGraph.prototype.removeEdge = function(vertex1,vertex2)
{
    if(this.edges[vertex1] && this.edges[vertex1][vertex2] != undefined)
    {
        delete this.edges[vertex1][vertex2];
    }
    if(this.edges[vertex2] && this.edges[vertex2][vertex1]!=undefined)
    {
        delete this.edges[vertex2][vertex1];
    }
}
undirectedGraph.prototype.removeVertex = function(vertex)
{
    for(var adjacentVertex in this.edges[vertex])
    {
        this.removeEdge(adjacentVertex,vertex)
    }
    delete this.edges[vertex];
}

var graph2 = new undirectedGraph();

graph2.addVertex(1);
graph2.addVertex(2);
graph2.addEdge(1,2,1);
console.log(graph2.edges);
graph2.addVertex(3);
graph2.addVertex(4);
graph2.addVertex(5);
graph2.addEdge(2,3,8);
graph2.addEdge(4,5,100);
graph2.addEdge(1,5,88);
graph2.removeVertex(1);
graph2.removeEdge(2,3)