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

Rename EntityMap to ElementMap (tests not yet updated)

Browse Source
This commit is contained in:
warrence
2026-08-06 23:01:10 +02:00
parent 7d8c9aaa10
commit a7346bd782
9 changed files with 58 additions and 58 deletions
Download Patch File Download Diff File Expand all files Collapse all files
src/testing/bfs_testing.rs
+2 -2
View File
@@ -194,7 +194,7 @@ macro_rules! bfs_tests {
}
fn assert_bfs_distances(
distances: &$crate::maps::EntityMap<
distances: &$crate::maps::ElementMap<
<$T as $crate::traits::GraphTopology>::Vertex,
Option<u32>,
>,
@@ -222,7 +222,7 @@ macro_rules! bfs_tests {
}
fn assert_bfs_predecessors(
predecessors: &$crate::maps::EntityMap<
predecessors: &$crate::maps::ElementMap<
<$T as $crate::traits::GraphTopology>::Vertex,
Option<<$T as $crate::traits::GraphTopology>::Vertex>,
>,
src/testing/dfs_testing.rs
+3 -3
View File
@@ -163,7 +163,7 @@ macro_rules! dfs_tests {
}
fn assert_dfs_visited(
visited: &$crate::maps::EntityMap<<$T as $crate::traits::GraphTopology>::Vertex, bool>,
visited: &$crate::maps::ElementMap<<$T as $crate::traits::GraphTopology>::Vertex, bool>,
vertices: &[<$T as $crate::traits::GraphTopology>::Vertex],
) {
for i in 0..10 {
@@ -177,8 +177,8 @@ macro_rules! dfs_tests {
fn assert_dfs_predecessors(
graph: &$T,
visited: &$crate::maps::EntityMap<<$T as $crate::traits::GraphTopology>::Vertex, bool>,
predecessors: &$crate::maps::EntityMap<
visited: &$crate::maps::ElementMap<<$T as $crate::traits::GraphTopology>::Vertex, bool>,
predecessors: &$crate::maps::ElementMap<
<$T as $crate::traits::GraphTopology>::Vertex,
Option<<$T as $crate::traits::GraphTopology>::Vertex>,
>,
src/testing/dijkstra_testing.rs
+5 -5
View File
@@ -131,7 +131,7 @@ macro_rules! dijkstra_tests {
}
fn assert_distances_single_vertex(
distances: &$crate::maps::EntityMap<
distances: &$crate::maps::ElementMap<
<$T as $crate::traits::GraphTopology>::Vertex,
Option<u32>,
>,
@@ -160,7 +160,7 @@ macro_rules! dijkstra_tests {
}
fn assert_distances_disconnected(
distances: &$crate::maps::EntityMap<
distances: &$crate::maps::ElementMap<
<$T as $crate::traits::GraphTopology>::Vertex,
Option<u32>,
>,
@@ -204,7 +204,7 @@ macro_rules! dijkstra_tests {
}
fn assert_distances_test_graph(
distances: &$crate::maps::EntityMap<
distances: &$crate::maps::ElementMap<
<$T as $crate::traits::GraphTopology>::Vertex,
Option<u32>,
>,
@@ -261,7 +261,7 @@ macro_rules! dijkstra_tests {
}
fn assert_distances_unweighted_test_graph(
distances: &$crate::maps::EntityMap<
distances: &$crate::maps::ElementMap<
<$T as $crate::traits::GraphTopology>::Vertex,
Option<u32>,
>,
@@ -302,7 +302,7 @@ macro_rules! dijkstra_tests {
<$T as $crate::traits::GraphTopology>::Edge,
>,
>; 10],
$crate::maps::EntityMap<<$T as $crate::traits::GraphTopology>::Edge, u32>,
$crate::maps::ElementMap<<$T as $crate::traits::GraphTopology>::Edge, u32>,
) {
use $crate::traits::GraphTopology;
let (graph, vertices, edges, incidences) = make_test_graph();