warrence/grapherity
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Initial release #1

Merged
warrence merged 102 commits from dev into main 2026-06-30 10:26:52 +02:00
Conversation 0 Commits 102 Files Changed 30
+6 -6
1 changed files with 6 additions and 6 deletions
Download Patch File Download Diff File Expand all files Collapse all files
Showing only changes of commit 13daf20e1c - Show all commits
src/testing/dijkstra_testing.rs
+6 -6
View File
@@ -2,7 +2,7 @@
macro_rules! dijkstra_tests { macro_rules! dijkstra_tests {
($T:ty) => { ($T:ty) => {
#[test] #[test]
fn dijkstra_single_vertex() { fn dijkstra_unweighted_single_vertex() {
let mut graph = <$T>::new(); let mut graph = <$T>::new();
let v1 = graph.add_vertex(); let v1 = graph.add_vertex();
let result = $crate::algorithms::dijkstra_unweighted(&graph, v1); let result = $crate::algorithms::dijkstra_unweighted(&graph, v1);
@@ -19,7 +19,7 @@ macro_rules! dijkstra_tests {
} }
#[test] #[test]
fn dijkstra_disconnected() { fn dijkstra_unweighted_disconnected() {
let mut graph = <$T>::new(); let mut graph = <$T>::new();
let v1 = graph.add_vertex(); let v1 = graph.add_vertex();
let v2 = graph.add_vertex(); let v2 = graph.add_vertex();
@@ -47,7 +47,7 @@ macro_rules! dijkstra_tests {
} }
#[test] #[test]
fn dijkstra() { fn dijkstra_unweighted() {
let (graph, vertices, _, _) = make_test_graph(); let (graph, vertices, _, _) = make_test_graph();
let result = $crate::algorithms::dijkstra_unweighted(&graph, vertices[0]); let result = $crate::algorithms::dijkstra_unweighted(&graph, vertices[0]);
let expected_distances_from_v0 = [ let expected_distances_from_v0 = [
@@ -92,7 +92,7 @@ macro_rules! dijkstra_tests {
} }
#[test] #[test]
fn dijkstra_distances_single_vertex() { fn dijkstra_distances_unweighted_single_vertex() {
let mut graph = <$T>::new(); let mut graph = <$T>::new();
let v1 = graph.add_vertex(); let v1 = graph.add_vertex();
let distances = $crate::algorithms::dijkstra_distances_unweighted(&graph, v1); let distances = $crate::algorithms::dijkstra_distances_unweighted(&graph, v1);
@@ -104,7 +104,7 @@ macro_rules! dijkstra_tests {
} }
#[test] #[test]
fn dijkstra_distances_disconnected() { fn dijkstra_distances_unweighted_disconnected() {
let mut graph = <$T>::new(); let mut graph = <$T>::new();
let v1 = graph.add_vertex(); let v1 = graph.add_vertex();
let v2 = graph.add_vertex(); let v2 = graph.add_vertex();
@@ -122,7 +122,7 @@ macro_rules! dijkstra_tests {
} }
#[test] #[test]
fn dijkstra_distances() { fn dijkstra_distances_unweighted() {
let (graph, vertices, _, _) = make_test_graph(); let (graph, vertices, _, _) = make_test_graph();
let distances = let distances =
$crate::algorithms::dijkstra_distances_unweighted(&graph, vertices[0]); $crate::algorithms::dijkstra_distances_unweighted(&graph, vertices[0]);