Commitd89626a

committed

add more

1 parent3e16c29 commitd89626aCopy full SHA for d89626a

File tree

+47

-0

lines changed

+47

-0

lines changed

Lines changed: 40 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,40 @@`
	`1`	`+/**`
	`2`	`+ * Definition for undirected graph.`
	`3`	`+ * function UndirectedGraphNode(label) {`
	`4`	`+ * this.label = label;`
	`5`	`+ * this.neighbors = []; // Array of UndirectedGraphNode`
	`6`	`+ * }`
	`7`	`+ */`
	`8`	`+/**`
	`9`	`+ *@param {UndirectedGraphNode} graph`
	`10`	`+ *@return {UndirectedGraphNode}`
	`11`	`+ */`
	`12`	`+varcloneGraph=function(graph){`
	`13`	`+varvisited={};`
	`14`	`+`
	`15`	`+if(graph===null){`
	`16`	`+returngraph;`
	`17`	`+}else{`
	`18`	`+returndfs(graph);`
	`19`	`+}`
	`20`	`+`
	`21`	`+functiondfs(node){`
	`22`	`+varnewNode=null;`
	`23`	`+`
	`24`	`+if(visited[node.label]){`
	`25`	`+newNode=visited[node.label];`
	`26`	`+}else{`
	`27`	`+newNode=newUndirectedGraphNode(node.label);`
	`28`	`+visited[node.label]=newNode;`
	`29`	`+}`
	`30`	`+`
	`31`	`+for(vari=0;i<node.neighbors.length;i++){`
	`32`	`+if(!visited[node.neighbors[i].label]){`
	`33`	`+newNode.neighbors.push(dfs(node.neighbors[i]));`
	`34`	`+}else{`
	`35`	`+newNode.neighbors.push(visited[node.neighbors[i].label]);`
	`36`	`+}`
	`37`	`+}`
	`38`	`+returnnewNode;`
	`39`	`+}`
	`40`	`+};`

Lines changed: 7 additions & 0 deletions

Comments

(0)