src/testing/dijkstra_testing.rs

@@ -2,7 +2,7 @@
 macro_rules! dijkstra_tests {
     ($T:ty) => {
         #[test]
-        fn dijkstra_single_vertex() {
+        fn dijkstra_unweighted_single_vertex() {
             let mut graph = <$T>::new();
             let v1 = graph.add_vertex();
             let result = $crate::algorithms::dijkstra_unweighted(&graph, v1);
@@ -19,7 +19,7 @@ macro_rules! dijkstra_tests {
         }
 
         #[test]
-        fn dijkstra_disconnected() {
+        fn dijkstra_unweighted_disconnected() {
             let mut graph = <$T>::new();
             let v1 = graph.add_vertex();
             let v2 = graph.add_vertex();
@@ -47,7 +47,7 @@ macro_rules! dijkstra_tests {
         }
 
         #[test]
-        fn dijkstra() {
+        fn dijkstra_unweighted() {
             let (graph, vertices, _, _) = make_test_graph();
             let result = $crate::algorithms::dijkstra_unweighted(&graph, vertices[0]);
             let expected_distances_from_v0 = [
@@ -92,7 +92,7 @@ macro_rules! dijkstra_tests {
         }
 
         #[test]
-        fn dijkstra_distances_single_vertex() {
+        fn dijkstra_distances_unweighted_single_vertex() {
             let mut graph = <$T>::new();
             let v1 = graph.add_vertex();
             let distances = $crate::algorithms::dijkstra_distances_unweighted(&graph, v1);
@@ -104,7 +104,7 @@ macro_rules! dijkstra_tests {
         }
 
         #[test]
-        fn dijkstra_distances_disconnected() {
+        fn dijkstra_distances_unweighted_disconnected() {
             let mut graph = <$T>::new();
             let v1 = graph.add_vertex();
             let v2 = graph.add_vertex();
@@ -122,7 +122,7 @@ macro_rules! dijkstra_tests {
         }
 
         #[test]
-        fn dijkstra_distances() {
+        fn dijkstra_distances_unweighted() {
             let (graph, vertices, _, _) = make_test_graph();
             let distances =
                 $crate::algorithms::dijkstra_distances_unweighted(&graph, vertices[0]);