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);
  edgelist.put(vertex.label, null);
  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)
  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();
   * 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
   //checking vertex distance if it minimum distance make it as 0
    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
    //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
    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

 //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.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} );
  System.out.println("shortest distance in a graph using djikstra");




Popular posts from this blog

Basics of System Design

This article is first one from the series of articles dedicated to system design interviews. Here i am going to present the base scenario to consider before starting to solve system design problems.
Questions to ask?
1) what is the number of requests a website will recieve in a day/month/second? 2) what is the amount of memory a website will deal in a day/month/second? 3) what is the number of servers that can accomodate these requests?
To answer this , first we need to remember the below numbers:-
1 million = 10 lakh = 1000000 = 10^6 1 billion = 1000 million = 10^9
1 KB = 1024 B = 10^31 MB= 10^6 = 1024 KB 1 GB= 10^9 = 1024 MB1 TB = 10^12 = 1024 GB
Memory we need to see in BytesRequests we need to see in numbers
example :-
suppose a website recieves 100M requests every month then:-
requests per day = request per month /24 = 416700 requests requests per second = requests per day / (24*3600) = 4.8 requests per second
if we take 20:80 principal where 20 percent is write and 80 percent is …

Calculating size of User and Cache storage

user storage:-
it can be solved using same scenario as mentioned in first article .

Suppose there are 12 Million of users are adding every year meaning 1 Million per month.
So if we consider 5 year there will be around 60 million of users. Now in terms of data we can look to our DB table and get information about it. A user will be generally having name , id , address , some forien keys .
Lets assume 10 columns with each column on an average storing 4 byte of data.
10*4 = 40 bytes of data for one user.
60 * 10^6 * 40 = 2400 * 10^6 = 2.4 * 10^9 = 2.4 GB of data we need to store only user values.
Also while calculating storage for the user there is also one important point we need to remember is of ids. If we are going to have 60 Million of users which means 60*10^6 users so unique id’s will be
as we know below figures are almost equal
2^10=10^3 then 60*(10^3)^2 = 2^20 *2^6
which means we almost need 26 …