Fix references to data_structures

felipernb · Nov 14, 2014 · 5c65806 · 5c65806
1 parent ad22e1a
commit 5c65806
Show file tree

Hide file tree

Showing 8 changed files with 10 additions and 10 deletions.
diff --git a/src/algorithms/graph/breadth_first_search.js b/src/algorithms/graph/breadth_first_search.js
@@ -1,6 +1,6 @@
 'use strict';
 
-var Queue = require('../../data_structures/queue');
+var Queue = require('../../data_structure/queue');
 
 
 /**

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

diff --git a/src/algorithms/graph/euler_path.js b/src/algorithms/graph/euler_path.js
@@ -1,7 +1,7 @@
 'use strict';
 
 
-var Graph = require('../../data_structures/graph'),
+var Graph = require('../../data_structure/graph'),
     depthFirstSearch = require('../../algorithms/graph/depth_first_search');
 
 

diff --git a/src/algorithms/graph/kruskal.js b/src/algorithms/graph/kruskal.js
@@ -1,7 +1,7 @@
 'use strict';
 
-var DisjointSetForest = require('../../data_structures/disjoint_set_forest'),
-    Graph = require('../../data_structures/graph');
+var DisjointSetForest = require('../../data_structure/disjoint_set_forest'),
+    Graph = require('../../data_structure/graph');
 
 
 /**

diff --git a/src/algorithms/graph/prim.js b/src/algorithms/graph/prim.js
@@ -1,7 +1,7 @@
 'use strict';
 
-var PriorityQueue = require('../../data_structures/priority_queue'),
-    Graph = require('../../data_structures/graph');
+var PriorityQueue = require('../../data_structure/priority_queue'),
+    Graph = require('../../data_structure/graph');
 
 
 /**

diff --git a/src/algorithms/graph/topological_sort.js b/src/algorithms/graph/topological_sort.js
@@ -1,6 +1,6 @@
 'use strict';
 
-var Stack = require('../../data_structures/stack'),
+var Stack = require('../../data_structure/stack'),
     depthFirstSearch = require('../../algorithms/graph/depth_first_search');
 
 /**

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

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