DataStructures package in plural seems to make more sense

Author: felipernb

Makefile

@@ -13,9 +13,6 @@ dist: all
 	cp README.md _build
 	cp CHANGELOG _build
 
-release: dist
-	cd _build; npm publish
-
 jshint: setup
 	jshint src
 

README.md

@@ -1,6 +1,6 @@
 'use strict';
 
-var Queue = require('../../data_structure/queue');
+var Queue = require('../../data_structures/queue');
 
 
 /**

bundle/algorithms.browser.min.js

@@ -1,6 +1,6 @@
 'use strict';
 
-var PriorityQueue = require('../../data_structure/priority_queue');
+var PriorityQueue = require('../../data_structures/priority_queue');
 
 /**
  * Calculates the shortest paths in a graph to every node from the node s

src/algorithms/graph/breadth_first_search.js

@@ -1,7 +1,7 @@
 'use strict';
 
 
-var Graph = require('../../data_structure/graph'),
+var Graph = require('../../data_structures/graph'),
     depthFirstSearch = require('../../algorithms/graph/depth_first_search');
 
 

src/algorithms/graph/dijkstra.js

@@ -1,7 +1,7 @@
 'use strict';
 
-var DisjointSetForest = require('../../data_structure/disjoint_set_forest'),
-    Graph = require('../../data_structure/graph');
+var DisjointSetForest = require('../../data_structures/disjoint_set_forest'),
+    Graph = require('../../data_structures/graph');
 
 
 /**

src/algorithms/graph/euler_path.js

@@ -1,7 +1,7 @@
 'use strict';
 
-var PriorityQueue = require('../../data_structure/priority_queue'),
-    Graph = require('../../data_structure/graph');
+var PriorityQueue = require('../../data_structures/priority_queue'),
+    Graph = require('../../data_structures/graph');
 
 
 /**

src/algorithms/graph/kruskal.js

@@ -1,6 +1,6 @@
 'use strict';
 
-var Stack = require('../../data_structure/stack'),
+var Stack = require('../../data_structures/stack'),
     depthFirstSearch = require('../../algorithms/graph/depth_first_search');
 
 /**

src/algorithms/graph/prim.js

@@ -1,5 +1,5 @@
 'use strict';
-var Queue = require('../../data_structure/queue.js');
+var Queue = require('../../data_structures/queue.js');
 
 /**
  * Breadth-first search for binary trees

src/algorithms/graph/topological_sort.js

@@ -1,5 +1,5 @@
 'use strict';
-var MinHeap = require('../../data_structure/heap').MinHeap;
+var MinHeap = require('../../data_structures/heap').MinHeap;
 
 /**
  * Heap sort first creates a valid heap data structure. Next it

src/algorithms/search/bfs.js

@@ -0,0 +1,15 @@
+'use strict';
+
+// Data Structures
+module.exports = {
+  BST: require('./data_structures/bst'),
+  Graph: require('./data_structures/graph'),
+  HashTable: require('./data_structures/hash_table'),
+  Heap: require('./data_structures/heap'),
+  LinkedList: require('./data_structures/linked_list'),
+  PriorityQueue: require('./data_structures/priority_queue'),
+  Queue: require('./data_structures/queue'),
+  Stack: require('./data_structures/stack'),
+  Set: require('./data_structures/set'),
+  DisjointSetForest: require('./data_structures/disjoint_set_forest')
+};

src/algorithms/sorting/heap_sort.js

@@ -1,7 +1,7 @@
 'use strict';
 
 var lib = {
-  DataStructure: require('./data_structure'),
+  DataStructures: require('./data_structures'),
   Graph: require('./graph'),
   Math: require('./math'),
   Search: require('./search'),

src/data_structure.js

@@ -2,7 +2,7 @@
 
 var root = require('../../../'),
     SPFA = root.Graph.SPFA,
-    Graph = root.DataStructure.Graph,
+    Graph = root.DataStructures.Graph,
     assert = require('assert');
 
 describe('SPFA Algorithm', function () {

src/data_structures.js

@@ -2,7 +2,7 @@
 
 var root = require('../../../'),
     bellmanFord = root.Graph.bellmanFord,
-    Graph = root.DataStructure.Graph,
+    Graph = root.DataStructures.Graph,
     assert = require('assert');
 
 describe('Bellman-Ford Algorithm', function () {

src/data_structure/bst.js renamed to src/data_structures/bst.js

@@ -2,7 +2,7 @@
 
 var root = require('../../../'),
     bfsShortestPath = root.Graph.bfsShortestPath,
-    Graph = root.DataStructure.Graph,
+    Graph = root.DataStructures.Graph,
     assert = require('assert');
 
 

src/data_structure/disjoint_set_forest.js renamed to src/data_structures/disjoint_set_forest.js

@@ -2,7 +2,7 @@
 
 var root = require('../../../'),
     breadthFirstSearch = root.Graph.breadthFirstSearch,
-    Graph = root.DataStructure.Graph,
+    Graph = root.DataStructures.Graph,
     assert = require('assert');
 
 

src/data_structure/graph.js renamed to src/data_structures/graph.js

@@ -2,7 +2,7 @@
 
 var root = require('../../../'),
     depthFirstSearch = root.Graph.depthFirstSearch,
-    Graph = root.DataStructure.Graph,
+    Graph = root.DataStructures.Graph,
     assert = require('assert');
 
 describe('Depth First Search Algorithm', function () {

src/data_structure/hash_table.js renamed to src/data_structures/hash_table.js

@@ -2,7 +2,7 @@
 
 var root = require('../../../'),
     dijkstra = root.Graph.dijkstra,
-    Graph = root.DataStructure.Graph,
+    Graph = root.DataStructures.Graph,
     assert = require('assert');
 
 describe('Dijkstra Algorithm', function () {

src/data_structure/heap.js renamed to src/data_structures/heap.js

@@ -3,7 +3,7 @@
 
 var root = require('../../../'),
     eulerPath = root.Graph.eulerPath,
-    Graph = root.DataStructure.Graph,
+    Graph = root.DataStructures.Graph,
     assert = require('assert');
 
 

src/data_structure/linked_list.js renamed to src/data_structures/linked_list.js

@@ -2,7 +2,7 @@
 
 var root = require('../../../'),
     floydWarshall = root.Graph.floydWarshall,
-    Graph = root.DataStructure.Graph,
+    Graph = root.DataStructures.Graph,
     assert = require('assert');
 
 

src/data_structure/priority_queue.js renamed to src/data_structures/priority_queue.js

@@ -4,7 +4,7 @@ var root = require('../../../'),
     kruskal = root.Graph.kruskal,
     prim = root.Graph.prim,
     depthFirstSearch = root.Graph.depthFirstSearch,
-    Graph = root.DataStructure.Graph,
+    Graph = root.DataStructures.Graph,
     assert = require('assert');
 
 

src/data_structure/queue.js renamed to src/data_structures/queue.js

@@ -2,7 +2,7 @@
 
 var root = require('../../../'),
     topologicalSort = root.Graph.topologicalSort,
-    Graph = root.DataStructure.Graph,
+    Graph = root.DataStructures.Graph,
     assert = require('assert');
 
 describe('Topological Sort', function () {

src/data_structure/set.js renamed to src/data_structures/set.js

@@ -1,7 +1,7 @@
 'use strict';
 
 var root = require('../../..'),
-    BST = root.DataStructure.BST,
+    BST = root.DataStructures.BST,
     bfs = root.Search.bfs,
     assert = require('assert');
 

src/data_structure/stack.js renamed to src/data_structures/stack.js

@@ -1,7 +1,7 @@
 'use strict';
 
 var root = require('../../..'),
-    BST = root.DataStructure.BST,
+    BST = root.DataStructures.BST,
     dfs = root.Search.dfs,
     assert = require('assert');
 

src/index.js

@@ -1,7 +1,7 @@
 'use strict';
 
 var root = require('../..'),
-    BST = root.DataStructure.BST,
+    BST = root.DataStructures.BST,
     bfs = root.Search.bfs,
     assert = require('assert');
 

src/test/algorithms/graph/SPFA.js

@@ -1,6 +1,6 @@
 'use strict';
 
-var DisjointSetForest = require('../..').DataStructure.DisjointSetForest,
+var DisjointSetForest = require('../..').DataStructures.DisjointSetForest,
     assert = require('assert');
 
 

src/test/algorithms/graph/bellman_ford.js

@@ -1,6 +1,6 @@
 'use strict';
 
-var Graph = require('../..').DataStructure.Graph,
+var Graph = require('../..').DataStructures.Graph,
     assert = require('assert');
 
 describe('Graph - Adjacency list', function () {

src/test/algorithms/graph/bfs_shortest_path.js

@@ -1,6 +1,6 @@
 'use strict';
 
-var HashTable = require('../..').DataStructure.HashTable,
+var HashTable = require('../..').DataStructures.HashTable,
     assert = require('assert');
 
 describe('Hash Table', function () {

src/test/algorithms/graph/breadth_first_search.js

@@ -1,6 +1,6 @@
 'use strict';
 
-var heap = require('../..').DataStructure.Heap,
+var heap = require('../..').DataStructures.Heap,
     assert = require('assert');
 
 describe('Min Heap', function () {

src/test/algorithms/graph/depth_first_search.js

@@ -1,6 +1,6 @@
 'use strict';
 
-var LinkedList = require('../..').DataStructure.LinkedList,
+var LinkedList = require('../..').DataStructures.LinkedList,
     assert = require('assert');
 
 describe('LinkedList', function () {

src/test/algorithms/graph/dijkstra.js

@@ -1,6 +1,6 @@
 'use strict';
 
-var PriorityQueue = require('../..').DataStructure.PriorityQueue,
+var PriorityQueue = require('../..').DataStructures.PriorityQueue,
     assert = require('assert');
 
 describe('Min Priority Queue', function () {

src/test/algorithms/graph/euler_path.js

@@ -1,6 +1,6 @@
 'use strict';
 
-var Queue = require('../..').DataStructure.Queue,
+var Queue = require('../..').DataStructures.Queue,
     assert = require('assert');
 
 describe('Queue', function () {

src/test/algorithms/graph/floyd_warshall.js

@@ -1,6 +1,6 @@
 'use strict';
 
-var HashSet = require('../..').DataStructure.Set,
+var HashSet = require('../..').DataStructures.Set,
     assert = require('assert');
 
 describe('HashSet', function () {

src/test/algorithms/graph/minimum_spanning_tree.js

@@ -1,6 +1,6 @@
 'use strict';
 
-var Stack = require('../..').DataStructure.Stack,
+var Stack = require('../..').DataStructures.Stack,
     assert = require('assert');
 
 describe('Stack', function () {