Remove extra lookups and memory allocations from tsort graph construction

Author: Nekrolm

src/uu/tsort/src/tsort.rs

@@ -42,8 +42,6 @@ enum TsortError {
 
 impl UError for TsortError {}
 
-
-
 #[uucore::main]
 pub fn uumain(args: impl uucore::Args) -> UResult<()> {
     let matches = uucore::clap_localization::handle_clap_result(uu_app(), args)?;
@@ -65,9 +63,9 @@ pub fn uumain(args: impl uucore::Args) -> UResult<()> {
 
     // Create the directed graph from pairs of tokens in the input data.
     let mut g = Graph::new(input.to_string_lossy().to_string());
-    
+
     let mut edgetokens = data.split_whitespace();
-    
+
     loop {
         let Some(a) = edgetokens.next() else {
             break;