refactored to factory function to the Graph Data Strucutre

Author: crizstian

11-chapter-Graphs/graph.module.js

@@ -3,73 +3,65 @@
 
   const graphFactory = () => {
     let graph = {}
-    let graphProto = {}
     let vertices = 0
 
-    graphProto.contains = (node) => !!graph[node]
-
-    graphProto.hasEdge = (nodeOne, nodeTwo) => {
-      if (graphProto.contains(nodeOne) && graphProto.contains(nodeTwo)) {
-        return !!graph[nodeOne].edges[nodeTwo]
-      }
-    }
-
-    graphProto.addVertex = (node) => {
-      if (!graphProto.contains(node)) {
-        graph[node] = {edges: {}, visited: false}
-        vertices += 1
-      }
-    }
-
-    graphProto.removeVertex = (node) => {
-      if (graphProto.contains(node)) {
-        for (let item in graph[node].edges) {
-          if (graph[node].edges.hasOwnProperty(item)) {
-            graph.removeEdge(node, item)
+    const graphProto = {
+      contains: (node) => !!graph[node],
+      hasEdge: (nodeOne, nodeTwo) => {
+        if (graphProto.contains(nodeOne) && graphProto.contains(nodeTwo)) {
+          return !!graph[nodeOne].edges[nodeTwo]
+        }
+      },
+      addVertex: (node) => {
+        if (!graphProto.contains(node)) {
+          graph[node] = {edges: {}, visited: false}
+          vertices += 1
+        }
+      },
+      removeVertex: (node) => {
+        if (graphProto.contains(node)) {
+          for (let item in graph[node].edges) {
+            if (graph[node].edges.hasOwnProperty(item)) {
+              graph.removeEdge(node, item)
+            }
           }
+          vertices -= 1
+          delete graph[node]
         }
-        vertices -= 1
-        delete graph[node]
-      }
-    }
-
-    graphProto.addEdge = (nodeOne, nodeTwo) => {
-      if (graphProto.contains(nodeOne) && graphProto.contains(nodeTwo)) {
-        graph[nodeOne].edges[nodeTwo] = true
-        graph[nodeTwo].edges[nodeOne] = true
-      }
-    }
-
-    graphProto.removeEdge = (nodeOne, nodeTwo) => {
-      if (graphProto.contains(nodeOne) && graphProto.contains(nodeTwo)) {
-        delete graph[nodeOne].edges[nodeTwo]
-        delete graph[nodeTwo].edges[nodeOne]
-      }
-    }
-
-    graphProto.showGraph = () => {
-      let show = ''
-      for (let v in graph) {
-        show += `${v} -> `
-        for (let n in graph[v].edges) {
-          show += n + ', '
+      },
+      addEdge: (nodeOne, nodeTwo) => {
+        if (graphProto.contains(nodeOne) && graphProto.contains(nodeTwo)) {
+          graph[nodeOne].edges[nodeTwo] = true
+          graph[nodeTwo].edges[nodeOne] = true
+        }
+      },
+      removeEdge: (nodeOne, nodeTwo) => {
+        if (graphProto.contains(nodeOne) && graphProto.contains(nodeTwo)) {
+          delete graph[nodeOne].edges[nodeTwo]
+          delete graph[nodeTwo].edges[nodeOne]
+        }
+      },
+      showGraph: () => {
+        let show = ''
+        for (let v in graph) {
+          show += `${v} -> `
+          for (let n in graph[v].edges) {
+            show += n + ', '
+          }
+          show += '\n'
         }
-        show += '\n'
-      }
-      console.log(show)
+        console.log(show)
+      },
+      showVertex: (node) => console.log(graphProto.getVertex(node)),
+      showVertexs: () => console.log(Object.keys(graph)),
+      getGraph: () => graph,
+      getVertex: (node) => (graphProto.contains(node)) ? graph[node] : false,
+      getNumVertices: () => vertices
     }
 
-    graphProto.showVertex = (node) => console.log(graphProto.getVertex(node))
-
-    graphProto.showVertexs = () => console.log(Object.keys(graph))
-
-    graphProto.getGraph = () => graph
-
-    graphProto.getVertex = (node) => (graphProto.contains(node)) ? graph[node] : false
-
-    graphProto.getNumVertices = () => vertices
+    Object.assign(graphProto, {bfs: bfs.bind(graphProto), dfs: dfs.bind(graphProto)})
 
-    return Object.assign(graphProto, {bfs: bfs.bind(graphProto), dfs: dfs.bind(graphProto)})
+    return Object.create(graphProto)
   }
 
   Object.assign(exports, {graph: graphFactory})

11-chapter-Graphs/test.js

@@ -1,7 +1,8 @@
 const {graph} = require('./graph.module')
 
 test('Graph Data Structure', assert => {
-  const devBook = Object.create(graph())
+  const devBook = graph()
+  const devBook2 = graph()
 
   devBook.addVertex('S')
   devBook.addVertex('A')
@@ -47,4 +48,28 @@ test('Graph Data Structure', assert => {
   console.log('BFS() search...')
 
   devBook.bfs()
+
+  devBook2.addVertex('F')
+  devBook2.addVertex('G')
+  devBook2.addVertex('H')
+  devBook2.addVertex('I')
+  devBook2.addVertex('J')
+  devBook2.addEdge('F', 'G')
+  devBook2.addEdge('F', 'H')
+  devBook2.addEdge('F', 'I')
+  devBook2.addEdge('G', 'J')
+  devBook2.addEdge('H', 'J')
+  devBook2.addEdge('I', 'J')
+
+  devBook2.showGraph()
+
+  devBook2.showVertexs()
+
+  console.log('DFS() search...')
+
+  devBook2.dfs()
+
+  console.log('BFS() search...')
+
+  devBook2.bfs()
 })