From 76fb35c4f398f656fd77f0cb324c982e33e45996 Mon Sep 17 00:00:00 2001
From: mijalshrestha <mshrestha@ryerson.ca>
Date: Tue, 11 Apr 2023 13:29:27 -0400
Subject: [PATCH] Dikstra kinda working

---
 scripts/functions.js | 138 +++++++++++++++++++++++++++++++++++--------
 1 file changed, 114 insertions(+), 24 deletions(-)

diff --git a/scripts/functions.js b/scripts/functions.js
index 58589a6..2b08d32 100644
--- a/scripts/functions.js
+++ b/scripts/functions.js
@@ -5,14 +5,19 @@ var nodes = [
     { data: { id: "3", labels: [randomIP(), "3"] } },
     { data: { id: "4", labels: [randomIP(), "4"] } },
     { data: { id: "5", labels: [randomIP(), "5"] } },
+    { data: { id: "6", labels: [randomIP(), "6"] } },
 ];
 var edges = [
-    { data: { id: "edge1", source: "1", target: "2", weight: 3 } },
-    { data: { id: "edge2", source: "2", target: "3", weight: 7 } },
-    { data: { id: "edge3", source: "3", target: "5", weight: 1 } },
-    { data: { id: "edge4", source: "4", target: "5", weight: 10 } },
-    { data: { id: "edge5", source: "1", target: "4", weight: 17 } },
-    { data: { id: "edge6", source: "2", target: "4", weight: 13 } },
+    { data: { id: "edge1", source: "1", target: "2", weight: 2 } },
+    { data: { id: "edge2", source: "1", target: "3", weight: 1 } },
+    { data: { id: "edge3", source: "1", target: "4", weight: 5 } },
+    { data: { id: "edge4", source: "2", target: "3", weight: 2 } },
+    { data: { id: "edge5", source: "3", target: "5", weight: 1 } },
+    { data: { id: "edge6", source: "4", target: "5", weight: 1 } },
+    { data: { id: "edge7", source: "4", target: "6", weight: 5 } },
+    { data: { id: "edge8", source: "5", target: "6", weight: 2 } },
+    { data: { id: "edge9", source: "2", target: "4", weight: 3 } },
+    { data: { id: "edge10", source: "3", target: "4", weight: 3 } },
 ];
 
 // Generate a random IP for a given node
@@ -55,7 +60,7 @@ var cy = cytoscape({
                 height: "50px",
                 "background-clip": "node",
                 shape: "rectangle",
-                "background-opacity": 0,
+                "background-color": "white",
                 "text-wrap": "wrap",
                 "text-max-width": 140,
                 "text-overflow-wrap": "anywhere",
@@ -151,7 +156,27 @@ var randomize = document.getElementById("randomize");
 
 //     cy.endBatch()
 // }
-
+function isConnected(cy, node1, node2) {
+    var node1 = cy.getElementById(node1);
+    var node2 = cy.getElementById(node2);
+  
+    var edges = node1.connectedEdges();
+  
+    for (var i = 0; i < edges.length; i++) {
+      var source = edges[i].source();
+      var target = edges[i].target();
+  
+      // check if they are connected
+      if (
+        (source === node1 && target === node2) ||
+        (source === node2 && target === node1)
+      ) {
+        return true;
+      }
+    }
+  
+    return false;
+}
 
 
 randomize.onclick = function () {
@@ -236,24 +261,89 @@ start.onclick = function () {
 
     djikstra(start, end);
 };
+const queue = [];
+const distances = {};
+const previousNodes = {};
+
+function enqueue(node) {
+    queue.push(node);
+    queue.sort((a, b) => distances[a] - distances[b]);
+}
+
+function djikstra(startNode) {
+    // Set initial distances and previous nodes
+   
+    cy.nodes().forEach(function(node) {
+      distances[node.id()] = Infinity;
+      previousNodes[node.id()] = null;
+    });
+    distances[startNode.id()] = 0;
+
+    
+    // Create a priority queue
+    //var queue = new PriorityQueue({ comparator: function(a, b) { return distances[a] - distances[b]; } });
+    //queue.enqueue(startNode.id());
+    enqueue(startNode.id());
+  
+
+    //console.log(queue);
+  
+    // Loop until the queue is empty
+    while (!(queue.length == 0)) {
+      // Get the node with the smallest distance
+      var currentNode = cy.nodes('[id="' + queue.shift() + '"]');
+      currentNode.style('background-color', 'red');
 
-function djikstra(start, end) {
-    // init distance vector
-    distance = {};
-    // init visited vector
-    visited = {};
-
-    // add distance and visited for each node
-    cy.nodes().forEach(function (node) {
-        // add distance
-        distance[node.id()] = Infinity;
-        // label initial distance infinity to nodes
-        var labels = node.data('labels'); // grab pre-existing labels
-        if (labels[labels.length - 1] !== '∞') {
-            labels.push('∞');
+     
+  
+      // Get the neighbors of the current node
+      var neighborNodes = currentNode.neighborhood().nodes();
+
+    //   neighborNodes.forEach(function(neighborNode) {
+    //     console.log(neighborNode.id());
+    //   });
+
+
+      // Loop through the neighbors
+      neighborNodes.forEach(function(neighborNode) {
+        var edge = currentNode.edgesWith(neighborNode);
+        var distance = edge.data('weight') + distances[currentNode.id()];
+        console.log(distances[currentNode.id()]);
+      
+        if (distance < distances[neighborNode.id()]) {
+          distances[neighborNode.id()] = distance;
+          previousNodes[neighborNode.id()] = currentNode.id();
+          //console.log(currentNode.id().toString());
+          enqueue(neighborNode.id());
+           // edge.style('line-color', 'blue');
         }
-        node.data('labels', labels);
 
+      });
 
-    })
+      console.log(previousNodes);
+      // console.log(distances);
+
+    }
+  
+    // Color the minimum path edges
+   // Loop through previousNodes dictionary
+Object.keys(previousNodes).forEach(function(nodeId) {
+    var previousNodeId = previousNodes[nodeId];
+    if (previousNodeId !== null) {
+      // Get the edge connecting the node with its previous node
+      var edge = cy.edges('[source="' + previousNodeId + '"][target="' + nodeId + '"]');
+      // Apply a style to color the edge
+      edge.style('line-color', 'green');
+    }
+  });
+    
+    // Update the distance labels
+    cy.nodes().forEach(function(node) {
+      node.style('label', distances[node.id()]);
+    });
 }
+    
+
+    
+    
+