GeezerVisonThe World Wide Web, restored to 800 pixels of glory. |
| Home|About|Gaming cabinet|Archives|How it works|Starter sites |
GeezerVison is showing github.com — JavaScript/Data-Structures/Graph/Graph2.js at master · Randomlyclueless/JavaScript Expand file tree/ Copy pathGraph2.jsMore file actions 62 lines (50 loc) · 1.32 KB / Copy pathGraph2.jsFile metadata and controls62 lines (50 loc) · 1.32 KB 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 // 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 } |
| You are visitor 01402520 — GeezerVison does not store the pages you look up. Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required. |