Merge pull request #247 from utkarshrai2811/dijkstra-algo-py

Dijkstra algo py

Author: ephremdeme

Algorithms/dijkstra_algo.py

@@ -0,0 +1,63 @@
+# Library for INT_MAX 
+import sys 
+   
+class Graph(): 
+   
+    def __init__(self, vertices): 
+        self.V = vertices 
+        self.graph = [[0 for column in range(vertices)]  
+                    for row in range(vertices)] 
+   
+    def printSolution(self, dist): 
+        print ("Vertex tDistance from Source") 
+        for node in range(self.V): 
+            print (node, "t", dist[node]) 
+   
+    # A utility function to find the vertex with  
+    # minimum distance value, from the set of vertices  
+    # not yet included in shortest path tree 
+    def minDistance(self, dist, sptSet): 
+   
+        # Initilaize minimum distance for next node 
+        min = sys.maxsize 
+   
+        # Search not nearest vertex not in the  
+        # shortest path tree 
+        for v in range(self.V): 
+            if dist[v] < min and sptSet[v] == False: 
+                min = dist[v] 
+                min_index = v 
+   
+        return min_index 
+   
+    # Funtion that implements Dijkstra's single source  
+    # shortest path algorithm for a graph represented  
+    # using adjacency matrix representation 
+    def dijkstra(self, src): 
+   
+        dist = [sys.maxsize] * self.V 
+        dist[src] = 0
+        sptSet = [False] * self.V 
+   
+        for cout in range(self.V): 
+   
+            # Pick the minimum distance vertex from  
+            # the set of vertices not yet processed.  
+            # u is always equal to src in first iteration 
+            u = self.minDistance(dist, sptSet) 
+   
+            # Put the minimum distance vertex in the  
+            # shotest path tree 
+            sptSet[u] = True
+   
+            # Update dist value of the adjacent vertices  
+            # of the picked vertex only if the current  
+            # distance is greater than new distance and 
+            # the vertex in not in the shotest path tree 
+            for v in range(self.V): 
+                if self.graph[u][v] > 0 and \
+                     sptSet[v] == False and \
+                     dist[v] > dist[u] + self.graph[u][v]: 
+                    dist[v] = dist[u] + self.graph[u][v] 
+   
+        self.printSolution(dist)

README.md

@@ -71,6 +71,7 @@ Thanks goes to these wonderful people ([emoji key](https://allcontributors.org/d
     <td align="center"><a href="https://github.com/codermind-divya"><img src="https://avatars0.githubusercontent.com/u/49811570?v=4" width="100px;" alt=""/><br /><sub><b>Divya Jain</b></sub></a><br /><a href="https://github.com/ephremdeme/data-structure-and-algorithms/commits?author=codermind-divya" title="Code">💻</a></td>
     <td align="center"><a href="https://github.com/mnb27"><img src="https://avatars1.githubusercontent.com/u/52792904?v=4" width="100px;" alt=""/><br /><sub><b>Aman Bilaiya</b></sub></a><br /><a href="https://github.com/ephremdeme/data-structure-and-algorithms/commits?author=mnb27" title="Code">💻</a> <a href="#ideas-mnb27" title="Ideas, Planning, & Feedback">🤔</a></td>
     <td align="center"><a href="https://www.linkedin.com/in/brijesh-kumar-887b05174"><img src="https://avatars3.githubusercontent.com/u/36602697?v=4" width="100px;" alt=""/><br /><sub><b>BRIJESH KUMAR</b></sub></a><br /><a href="https://github.com/ephremdeme/data-structure-and-algorithms/commits?author=brijeshsos66" title="Code">💻</a> <a href="#design-brijeshsos66" title="Design">🎨</a></td>
+    <td align="center"><a href="https://github.com/utkarshrai2811/"><img src="https://github.com/utkarshrai2811.png" width="100px;" alt=""/><br /><sub><b>Utkarsh Rai</b></sub></a><br /><a href="#design-utkarshrai2811" title="Design">🎨</a> <a href="https://github.com/ephremdeme/data-structure-and-algorithms/commits?author=utkarshrai2811" title="Code">💻</a></td>
   </tr>
 </table>
 

sorting-algorithms/insertion_sort_rs.rs

@@ -0,0 +1,44 @@
+/// Insertion sort.
+
+pub fn insertion_sort(arr: &mut [i32]) {
+    for i in 1..arr.len() {
+        let mut j = i;
+        while j > 0 && arr[j - 1] > arr[j] {
+            arr.swap(j - 1, j);
+            j -= 1;
+        }
+    }
+}
+
+/// Binary insertion sort.
+
+/// Binary insertion sort is a insertion sort variant that utilizes binary
+
+/// search to reduce comparisons in a normal insertion sort.
+
+pub fn binary_insertion_sort(arr: &mut [i32]) {
+    for i in 1..arr.len() {
+        let val = arr[i];
+        let mut j = i;
+        let pos = arr[..i].binary_search(&val).unwrap_or_else(|pos| pos);
+        // Swap all elements until specific position.
+        while j > pos {
+            arr.swap(j - 1, j);
+            j -= 1;
+        }
+    }
+}
+
+#[cfg(test)]
+
+mod base {
+    use super::*;
+    base_cases!(insertion_sort);
+}
+
+#[cfg(test)]
+
+mod binary_insertion {
+    use super::*;
+    base_cases!(binary_insertion_sort);
+}