8
8
//!
9
9
//! # Example
10
10
//! ```
11
- //! use simple_graph_algorithms::{Graph, graph:: instruction::Instructions};
11
+ //! use simple_graph_algorithms::{Graph, instruction::Instructions};
12
12
//! # fn main() -> Result<(), String> {
13
13
//!
14
14
//! // Create a vector that contains instructions.
@@ -61,7 +61,7 @@ impl<T: Display + Clone + From<String>> TryFrom<&Vec<&str>> for Instructions<T>
61
61
///
62
62
/// # Example
63
63
/// ```
64
- /// use simple_graph_algorithms::{Graph, graph:: instruction::Instructions};
64
+ /// use simple_graph_algorithms::{Graph, instruction::Instructions};
65
65
/// # fn main() -> Result<(), String> {
66
66
///
67
67
/// // 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
107
107
///
108
108
/// # Example
109
109
/// ```
110
- /// use simple_graph_algorithms::{Graph, graph:: instruction::Instructions};
110
+ /// use simple_graph_algorithms::{Graph, instruction::Instructions};
111
111
/// # fn main() -> Result<(), String> {
112
112
///
113
113
/// // Create a vector that contains instructions (this should normally be read from a file).
@@ -236,7 +236,7 @@ mod tests {
236
236
let spt = bellman_ford ( & mut graph, & String :: from ( "a" ) ) ;
237
237
assert ! ( spt. is_ok( ) ) ;
238
238
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 ) ) ;
240
240
}
241
241
242
242
}
0 commit comments