refactored

src/data_structures.rs

@@ -1 +0,0 @@
-

src/data_structures/mod.rs

@@ -0,0 +1,5 @@
+pub mod queue;
+pub mod stack;
+pub mod min_heap;
+pub mod weighted_adj_list;
+pub mod ring_buffer;

src/dijkstras.rs

@@ -1,8 +1,6 @@
-use crate::weighted_adj_list::{WeightedAdjacencyList};
+use crate::data_structures::{weighted_adj_list::WeightedAdjacencyList,min_heap::MinHeap};
-use crate::min_heap::MinHeap;
 #[cfg(test)]
 mod tests {
-    use crate::weighted_adj_list::WeightedAdjacencyList;
     use super::dijkstras_shortest_path;
     #[test]
     fn dijkstras_shortest_path_primeagen_class_test(){

src/main.rs

@@ -1,13 +1,11 @@
 mod linear_search;
 mod binary_search;
+mod merge_sort;
+mod heap_sort;
+mod radix_sort;
 mod bubble_sort;
 mod quick_sort;
 mod dijkstras;
-mod queue;
-mod stack;
-mod min_heap;
-mod weighted_adj_list;
-mod ring_buffer;
 mod data_structures;
 fn linear_search_demo(){
     println!("-------------------");