Dijkstra's Algorithm java

justformyntra8 · June 28, 2019, 7:23pm

I am getting a runtime error for the test case
Lemme know where I’m mistaken

bhardwaj-aman/java-data-structures-practice-questions/blob/master/graphs/DijstraGraph

package GraphPractice;
import  java.util.*;

public class Graph {
   static Scanner s = new Scanner(System.in);
    private class vertex{
        HashMap<String ,Integer> neighbours;
        vertex(){
            neighbours = new  HashMap<String ,Integer>();
        }
    }
    HashMap<String,vertex> vertices;
    Graph(){
        vertices = new HashMap<String, vertex>();
    }
    public int numvertex(){
        return vertices.size();
    }
    public boolean containsvertex(String a){
        for(String x:vertices.keySet()){

This file has been truncated. show original

adish_450 · July 2, 2019, 7:48pm

You are getting run error because of wrong logic in your unheapify function . When you try to access to isGreater(data.get§,data.get(x)) > 0 . In this in some cases x = data.size and this is giving array index out of bounds exception.

adish_450 · July 7, 2019, 7:24pm

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.