Export topological sort

Author: mgechev

src/graphs/others/topological-sort.js

@@ -1,44 +1,39 @@
-var topologicalSort = (function () {
+(function (exports) {
   'use strict';
 
-  function topologicalSortHelper(node, visited, temp, graph, result) {
-    temp[node] = true;
-    var neighbors = graph[node];
-    for (var i = 0; i < neighbors.length; i += 1) {
-      var n = neighbors[i];
-      if (temp[n]) {
-        throw new Error('The graph is not a DAG');
-      }
-      if (!visited[n]) {
-        topologicalSortHelper(n, visited, temp, graph, result);
+  var topologicalSort = (function () {
+
+    function topologicalSortHelper(node, visited, temp, graph, result) {
+      temp[node] = true;
+      var neighbors = graph[node];
+      for (var i = 0; i < neighbors.length; i += 1) {
+        var n = neighbors[i];
+        if (temp[n]) {
+          throw new Error('The graph is not a DAG');
+        }
+        if (!visited[n]) {
+          topologicalSortHelper(n, visited, temp, graph, result);
+        }
       }
+      temp[node] = false;
+      visited[node] = true;
+      result.push(node);
     }
-    temp[node] = false;
-    visited[node] = true;
-    result.push(node);
-  }
 
-  return function (graph) {
-    var result = [],
-        visited = [],
-        temp = [];
-    for (var node in graph) {
-      if (!visited[node] && !temp[node]) {
-        topologicalSortHelper(node, visited, temp, graph, result);
+    return function (graph) {
+      var result = [],
+          visited = [],
+          temp = [];
+      for (var node in graph) {
+        if (!visited[node] && !temp[node]) {
+          topologicalSortHelper(node, visited, temp, graph, result);
+        }
       }
-    }
-    return result.reverse();
-  };
-}());
+      return result.reverse();
+    };
+  }());
+
+  exports.topologicalSort = topologicalSort;
 
-var graph = {
-  '0': ['1', '2'],
-  '1': ['2', '4'],
-  '2': ['3'],
-  '3': [],
-  '4': ['5', '6'],
-  '5': [],
-  '6': ['3']
-};
+}(typeof exports === 'undefined' ? window : exports));
 
-console.log(topologicalSort(graph));