Thanks to visit codestin.com
Credit goes to github.com

Skip to content

Commit e428f49

Browse files
committed
Fixed tests that broke in previous commit
1 parent 924886a commit e428f49

File tree

2 files changed

+4
-5
lines changed

2 files changed

+4
-5
lines changed

Cargo.toml

Lines changed: 0 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -6,7 +6,6 @@ edition = "2021"
66
# See more keys and their definitions at https://doc.rust-lang.org/cargo/reference/manifest.html
77

88
[features]
9-
#default = ["from_instruction"] #TODO remove before release
109
from_instruction = []
1110

1211
[dependencies]

src/instruction.rs

Lines changed: 4 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -8,7 +8,7 @@
88
//!
99
//! # Example
1010
//! ```
11-
//! use simple_graph_algorithms::{Graph, graph::instruction::Instructions};
11+
//! use simple_graph_algorithms::{Graph, instruction::Instructions};
1212
//! # fn main() -> Result<(), String> {
1313
//!
1414
//! // Create a vector that contains instructions.
@@ -61,7 +61,7 @@ impl<T: Display + Clone + From<String>> TryFrom<&Vec<&str>> for Instructions<T>
6161
///
6262
/// # Example
6363
/// ```
64-
/// use simple_graph_algorithms::{Graph, graph::instruction::Instructions};
64+
/// use simple_graph_algorithms::{Graph, instruction::Instructions};
6565
/// # fn main() -> Result<(), String> {
6666
///
6767
/// // Create a vector that contains instructions (this should normally be read from a file).
@@ -107,7 +107,7 @@ impl<T: Display + Clone + From<String>> TryFrom<&Vec<String>> for Instructions<T
107107
///
108108
/// # Example
109109
/// ```
110-
/// use simple_graph_algorithms::{Graph, graph::instruction::Instructions};
110+
/// use simple_graph_algorithms::{Graph, instruction::Instructions};
111111
/// # fn main() -> Result<(), String> {
112112
///
113113
/// // Create a vector that contains instructions (this should normally be read from a file).
@@ -236,7 +236,7 @@ mod tests {
236236
let spt = bellman_ford(&mut graph, &String::from("a"));
237237
assert!(spt.is_ok());
238238
println!("{}", spt.as_ref().unwrap().shortest_path(&String::from("d")).unwrap());
239-
assert_eq!(spt.unwrap().shortest_distance(&String::from("d")), Some(5));
239+
assert_eq!(spt.unwrap().shortest_distance(&String::from("d")), Some(5));
240240
}
241241

242242
}

0 commit comments

Comments
 (0)