JavaScript/Data-Structures/Graph/Graph2.js at master · TheAlgorithms/JavaScript · GitHub

History

62 lines (50 loc) · 1.32 KB

Raw

// create a graph class

class Graph {

// defining vertex array and

// adjacent list

constructor(noOfVertices) {

this.noOfVertices = noOfVertices

this.AdjList = new Map()

}

// functions to be implemented

// addVertex(v)

// addEdge(v, w)

// printGraph()

// bfs(v)

// dfs(v)

// add vertex to the graph

addVertex(v) {

// initialize the adjacent list with a

// null array

this.AdjList.set(v, [])

}

// add edge to the graph

addEdge(v, w) {

// get the list for vertex v and put the

// vertex w denoting edge between v and w

this.AdjList.get(v).push(w)

// Since graph is undirected,

// add an edge from w to v also

this.AdjList.get(w).push(v)

}

// Prints the vertex and adjacency list

printGraph(output = (value) => console.log(value)) {

// get all the vertices

const getKeys = this.AdjList.keys()

// iterate over the vertices

for (const i of getKeys) {

// get the corresponding adjacency list

// for the vertex

const getValues = this.AdjList.get(i)

let conc = ''

// iterate over the adjacency list

// concatenate the values into a string

for (const j of getValues) {

conc += j + ' '

}

// print the vertex and its adjacency list

output(i + ' -> ' + conc)

}

export { Graph }

JavaScript/Data-Structures/Graph/Graph2.js at master · TheAlgorithms/JavaScript · GitHub

Uh oh!

Uh oh!

JavaScript/Data-Structures/Graph/Graph2.js at master · TheAlgorithms/JavaScript · GitHub

Uh oh!

Uh oh!

Expand file tree

Breadcrumbs

Graph2.js

Latest commit

History

Breadcrumbs

Graph2.js

File metadata and controls