Skip to main content

Shortest Path from source to Vertex :- Dijkstra Algorithm


Shortest Path from source to Vertex :- Dijkstra Algorithm:-

Dijkstra Algorithms is an algorithm use to find the shortest path from source vertex to a given vertex.



package Graph;

import java.util.HashMap;

abstract public class DirectedGraph {

 Vertex[] vertexlist=new Vertex[10];
 HashMap<Character,HashMap<Character,Integer>> edgelist=new HashMap<>();
 Vertex vertex;
 //count of vertex and edge
 static int vertexcount=0;
 int edgecount=0;
 /*
  * This function takes a label and insert in the vertex list as well as edge list since it is new vertex it will add
  * null to its adjoining vertices
  */
 int addVertex(char label)
 {
  vertex=new Vertex(label);
  vertexlist[vertexcount]=vertex;
  System.out.println(vertexlist[vertexcount].label);
  edgelist.put(vertex.label, null);
  vertexcount++;
  return vertexcount;
 }
 
 int addEdge(char label,char[] labels,int[] distances)
 {
  HashMap<Character,Integer> vertexlist=new HashMap<>();
  for(int i=0;i<labels.length;i++)
  {
  vertexlist.put(labels[i], distances[i]);
  }
  edgelist.put(label, vertexlist);
  return edgecount;
 }
 
 int removeEdge(char labelfrom,char labelto)
 {
  edgelist.get(labelfrom).remove(labelto);
  edgecount--;
  return edgecount;
 }
 
 HashMap<Character,Integer> getNeighbours(char label)
 {
  return edgelist.get(label);
 }
 
 void listOfVertex()
 {
  System.out.println("Total Vertex:"+ vertexcount);
  
  //This is how we traverse over a hashmap
  for(Object key:edgelist.keySet())
  {
   System.out.println(key+" " +edgelist.get(key));
  }
  
 }
}


package Graph;

import java.util.HashMap;
import java.util.LinkedList;
import java.util.Queue;
import java.util.Stack;

public class DirectedGraphImpl extends DirectedGraph {
 
 //Algorithm to search the shortest path
 public void djiksta(DirectedGraphImpl g)
 {
  //Creating new instance of grapg passed in parameter
  DirectedGraphImpl newgraph=new DirectedGraphImpl();
  newgraph=g;
  
  /*
   * Declaring hashmap for holding vertex value in character and distance from source in Integer
   */
  HashMap<Character,Integer> map=new HashMap<>();
  /*
   * Declaring queue to iterate graph in BFS fashion
   */
  Queue<Character> queue=new LinkedList<Character>();
  
  //Initializing new instance of graph with vertex and distance as minimum value
  for(int i=0;i<newgraph.vertexcount;i++)
  {
   map.put(vertexlist[i].label, Integer.MIN_VALUE);
  }
  
  //adding root to the queue
     queue.add(newgraph.vertexlist[0].label);
  
  
  
  while(!queue.isEmpty())
  {
   //checking vertex distance if it minimum distance make it as 0
   if(map.get(queue.peek())==Integer.MIN_VALUE)
   {
    map.put(queue.peek(), 0);
   }
   
   //Storing previous vertex name
   char previousvertex=queue.peek();
   
   //Getting neigbours of previous vertex as well as removing the same from queue tail
   HashMap<Character,Integer> neigbours=newgraph.getNeighbours(queue.remove());
   
   //if neighbours are there
   if(neigbours!=null)
   {
    
    //iterating over neighbours
   for(Character key:neigbours.keySet())
   {
    //Adding neighbour in queue from front
    
    /*
     * checking condition if distance(new vertex from previous vertex)+distance(source to previous vertex)
     * is less than what we have in able assign new distance to the table
     * 
     * 
     * supose from A to B distance is 4
     * from A to C distance is 1 and from C to A distance is 2 then
     * 
     *  A to B 4 will be replaced by 3
     */
    queue.add(key);
    int newvalue=neigbours.get(key)+map.get(previousvertex);
    
    //loop will only run when distance is less or distance not yet defined
    if(newvalue<map.get(key) || map.get(key)==Integer.MIN_VALUE)
    {
     map.put((Character) key, newvalue);
    }
    
   }
   }
   
  }
  
  //calling method to show final matrix of Vertex distance relation
  showShortestDistance(map);
    
 }
 

 
 //Iterating Hash Map to show the shortest distance of vertex from Source
 public void showShortestDistance(HashMap map)
 {
  for(Object key:map.keySet())
  {
   System.out.println(key.toString()+"    "+map.get(key));
  }
 }
 
 
 public static void main(String[] args)
 {
  DirectedGraphImpl dgraph=new DirectedGraphImpl();
  dgraph.addVertex('A');
  dgraph.addVertex('B');
  dgraph.addVertex('C');
  dgraph.addVertex('D');
  dgraph.addVertex('E');
  
  dgraph.addEdge('A', new char[]{'B','C'},new int[]{4,1} );
  dgraph.addEdge('B', new char[]{'E'},new int[]{4} );
  dgraph.addEdge('C', new char[]{'B','D'},new int[]{2,4} );
  dgraph.addEdge('D', new char[]{'E'},new int[]{4} );
  dgraph.listOfVertex();
  System.out.println("shortest distance in a graph using djikstra");
  dgraph.djiksta(dgraph);
  
 }

}

Comments

.

Popular posts from this blog

Insertion Sort in JAVA

What is insertion sort?

It is a sorting technique that is based on the partitioning of array into two parts like selection sort, sorted and unsorted.

The process is:-

compare adjacent elements.
if(left > right)
Swap the element
{
check for sorted array whether it is still in sort manner(put j=i and loop in until j is not equal to zero)
- No
check for if(right<left)
swap
do it until at the end of position.
}

Implementation:-

Underline eleemnts are part of sorted arrayinside main array loop 142710333519424 (141027333519424 (here sorted array is distorted hence sorting has been done inside the loop) inside sorted array loop101427333519424 inside main array loop101427333519424 inside main array loop 101427333519424 inside main array loop101427333519424 inside sorted array loop 101427193335424 inside sorted array loop 101419273335424 inside main array loop 101419273335424 inside main array loop 101419273335424 inside sorted array loop101419273343542 inside…