public void removen(int /remove item at for(int =nj<size- ++/move items down quearray[jquearray[ + ]size--public edge peekmin(/peek at minimum item return quearray[size- ]public int size(return size/return number of items public boolean isempty(return (size== )/true if queue is empty public edge peekn(int nreturn quearray[ ]/peek at item public int find(int finddex/find item with specified /destvert value for(int = <sizej++if(quearray[jdestvert =finddexreturn jreturn - /end class priorityq ///////////////////////////////////////////////////////////////class vertex public char labelpublic boolean isintree/label ( ' '/public vertex(char lab/constructor label labisintree false//end class vertex ///////////////////////////////////////////////////////////////class graph