Breadth First Search with Queue

import java.io.*;

import java.util.Scanner;

class Queue

{

    int items[]=new int[10];

    int front,rear;

    Queue()

    {

        front=0;

        rear=-1;

    }

    void Insert(int e)

    {

        if(rear==9)

            System.out.println("Queue overflow");

        else

            items[++rear]=e;

    }

    int Empty()

    {

        return(rear<front? 1:0);

    }