Fix formatting

This commit is contained in:
2026-06-26 15:38:49 +02:00
parent c147ed4974
commit c197766229
2 changed files with 8 additions and 3 deletions
+2 -1
View File
@@ -187,7 +187,8 @@ macro_rules! bfs_tests {
assert!( assert!(
found == vertices[7] || found == vertices[8], found == vertices[7] || found == vertices[8],
"unexpected nearest match vertex {found:?}, should be {:?} or {:?}", "unexpected nearest match vertex {found:?}, should be {:?} or {:?}",
vertices[7], vertices[8] vertices[7],
vertices[8]
); );
} }
+6 -2
View File
@@ -157,7 +157,8 @@ macro_rules! dfs_tests {
assert_eq!( assert_eq!(
$crate::algorithms::dfs_find_where(&graph, vertices[0], |v| v == vertices[9]), $crate::algorithms::dfs_find_where(&graph, vertices[0], |v| v == vertices[9]),
Some(vertices[9]), Some(vertices[9]),
"expected to find connected vertex"); "expected to find connected vertex"
);
} }
fn assert_dfs_visited( fn assert_dfs_visited(
@@ -190,7 +191,10 @@ macro_rules! dfs_tests {
for i in 1..10 { for i in 1..10 {
let v = vertices[i]; let v = vertices[i];
let p = predecessors[v].expect(&format!("vertex {v:?} should have a predecessor")); let p = predecessors[v].expect(&format!("vertex {v:?} should have a predecessor"));
assert!(visited[p], "predecessor {p:?} of vertex {v:?} should be visited"); assert!(
visited[p],
"predecessor {p:?} of vertex {v:?} should be visited"
);
assert!( assert!(
graph.are_adjacent(v, p), graph.are_adjacent(v, p),
"predecessor {p:?} of vertex {v:?} should be adjacent" "predecessor {p:?} of vertex {v:?} should be adjacent"