Skip to content

Commit

Permalink
fix testing
Browse files Browse the repository at this point in the history
  • Loading branch information
digizeph committed Jan 17, 2024
1 parent 8c110e0 commit d852ee9
Show file tree
Hide file tree
Showing 3 changed files with 3 additions and 3 deletions.
2 changes: 1 addition & 1 deletion examples/all_paths_between_two_ases.rs
Original file line number Diff line number Diff line change
Expand Up @@ -12,7 +12,7 @@ fn main() {
let ut_path = topo.paths_graph(university_of_twente_asn);

let paths = all_simple_paths::<Vec<_>, _>(
ut_path.graph,
&ut_path.graph,
ut_path.index_of(university_of_twente_asn).unwrap(),
ut_path.index_of(universidade_de_sao_paulo_asn).unwrap(),
0,
Expand Down
2 changes: 1 addition & 1 deletion examples/shortest_path_between_two_ases.rs
Original file line number Diff line number Diff line change
Expand Up @@ -13,7 +13,7 @@ fn main() {

// Use A* to find the shortest path between two nodes
let (_len, path) = astar(
ut_path.graph,
&ut_path.graph,
ut_path.index_of(university_of_twente_asn).unwrap(),
|finish| finish == ut_path.index_of(universidade_de_sao_paulo_asn).unwrap(),
|edge| match edge.weight() {
Expand Down
2 changes: 1 addition & 1 deletion src/lib.rs
Original file line number Diff line number Diff line change
Expand Up @@ -439,6 +439,6 @@ mod test {
assert!(has_edge(3, 6));

assert_eq!(topo.graph.edge_count(), 7);
assert!(!is_cyclic_directed(topo.graph));
assert!(!is_cyclic_directed(&topo.graph));
}
}

0 comments on commit d852ee9

Please sign in to comment.