public void getShortestPath()
    {
        System.out.println("Shortest path between two cities!");
        System.out.println("Enter the first city:");
        String src = scr.next();
        System.out.println("Enter the second city:");
        String dest = scr.next();
        Tuple<ArrayList<Vertex<String>>,Double> path;
        try
        {
            path = data.minimalPath(new Vertex<>(src), new Vertex<>(dest));
            if(path.getSecondElement() == -1)
            {
                System.out.println("Path doesn't exist.");
            }
            else
            {
                System.out.println("Path from " + src+ " to " + dest);
                System.out.println("From\tTo");
                for(int index = 0; index < path.getFirstElement().size()-1; index++)
                {
                    System.out.println(path.getFirstElement().get(index).getLabel()
                           + "\t" + path.getFirstElement().get(index+1).getLabel());
                }
                System.out.println("Total Distance: "+path.getSecondElement());
            }
        }
        catch(Exception e)
        {
            System.out.println("Invalid Input");
        }  
    }