Convert indentation to spaces

lightning/src/routing/pickhardt_router/min_cost_lib.rs

@@ -289,21 +289,21 @@ fn update_dis(u:Vindex, v:Vindex, w:i32, disu:i64, pre:&mut Vec<Vindex>, dis:&mu
     in_queue:&mut Vec<bool>,
     queue:&mut VecDeque<Vindex>, iter:&mut i32, n: Vindex) -> Vec<Vindex> {
                 pre[v] = u;
-				dis[v] = disu + w as i64;
+                dis[v] = disu + w as i64;
                 *iter+=1;
-				if *iter == n.value
+                if *iter == n.value
                 {
                     *iter = 0;
                     let cycle=detect_cycle(n, pre);
                     if !cycle.is_empty() {
                         return cycle;
                     }
                 }
-				if !in_queue[v]
-				{
+                if !in_queue[v]
+                {
                     queue.push_back(v);
-					in_queue[v] = true;
-				}
+                    in_queue[v] = true;
+                }
                 return Vec::new();
     }
 
@@ -314,31 +314,31 @@ fn spfa_early_terminate(n: Vindex, adj:&Vec<Vec<(Vindex, i32)>>, adj2: &Vec<Vec<
     let mut in_queue= vec![true; n.as_usize()];
     let mut queue: VecDeque<Vindex>=VecDeque::new();
     for i in 0..n.as_usize() {
-		queue.push_back(Vindex::from_usize(i));
+        queue.push_back(Vindex::from_usize(i));
     }
     let mut iter = 0;
 
-	while !queue.is_empty()
-	{
-		let u = *queue.front().unwrap();
-		queue.pop_front();
-		in_queue[u] = false;
+    while !queue.is_empty()
+    {
+        let u = *queue.front().unwrap();
+        queue.pop_front();
+        in_queue[u] = false;
         let disu: i64=dis[u];
         // cout << adj[u].len() << endl;
 
-		for i in 0..adj[u].len() {
+        for i in 0..adj[u].len() {
             let (v, w) : (Vindex, i32)=adj[u][i];
             let disv: i64=dis[v];
             if pre[u]==v  {  // Don't allow cycles of 2.
                 continue;
             }
             if (disu + w as i64) < disv
-			{
-				let cycle=update_dis(u, v, w, disu,  &mut pre, &mut dis, &mut in_queue, &mut queue, &mut iter, n);
+            {
+                let cycle=update_dis(u, v, w, disu,  &mut pre, &mut dis, &mut in_queue, &mut queue, &mut iter, n);
                 if !cycle.is_empty() { return cycle;}
-			}
+            }
         }
-	}
+    }
     return detect_cycle(n, &pre);
 }
 
@@ -619,7 +619,7 @@ fn decrease_total_cost( N:Vindex,adj:&mut Vec<Vec<(Vindex, i32)>>,adj2:&mut Vec<
     // elapsed("early terminate negative_cycle", begin);
     // let begin=Instant::now();
     if(debug) {
-	    println!("early terminate negative_cycle: {}", negative_cycle.len())
+        println!("early terminate negative_cycle: {}", negative_cycle.len())
     }
     let mut min_capacity=i32::MAX;
     let mut min_cost_idxs: Vec<Vindex>=Vec::new();