fila

package exercicios.fila.vetor;

public class Fila {

    private int front = 0;
    private int back = 0;
    private int array[] = new int[2];

    public void enqueue(int i) {
        if (back == 0) {
            array[back] = i;
            back++;
            System.out.println(i + " foi adcionado");
        } else if (back == front) {
            System.out.println("Fila cheia!");
        } else if (back == array.length) {
            back = 0;
        } else {
            array[back] = i;
            back++;
            System.out.println(i + " foi adcionado");
        }
    }

    public int dequeue() {
        if (front > back) {
            System.out.println("lista vazia");
        } else if (front == array.length) {
            front = 0;
        } else {
            front++;
        }
        return 0;
}
}


package exercicios.fila.vetor;

public class Node {

    public int info;
    Node next=null;
    Node previous= null;

    public Node(int i) {
        this.info = i;
    }

    public int getNode() {
        return info;
    }
    public void setNode(int node) {
        this.info = node;
    }
    public Node getNext() {
        return next;
    }
    public void setNext(Node next) {
        this.next = next;
    }
    public Node getPrevious() {
        return previous;
    }
    public void setPrevious(Node previous) {
        this.previous = previous;
    }
}


package exercicios.fila.vetor;

public class TestFila {

    public static void main(String[] args) {

        Fila f = new Fila();

        f.enqueue(1);
        f.enqueue(2);

        f.dequeue();

        f.enqueue(5);


    }

}

package exercicios.fila.vetor.node;

import exercicios.fila.vetor.Node;

public class Fila {

    private Node front=null;
    private Node back=null;

    public void enqueue(Node i) {
        if (back == null) {
            front = back = i;
        } else {
            back.setNext(i);
            i.setPrevious(back);
            back = i;
        }
        System.out.println(back.info);
    }

    public void dequeue() {
        if (front == null && back == null) {
            System.out.println("Fila vazia!");
        } else {
            front = front.getNext();
            front.setPrevious(null);
        }

        System.out.println(front.info);
    }
}


package exercicios.fila.vetor.node;

import exercicios.fila.vetor.Node;

public class TesteFila {

    public static void main(String[] args) {

        Fila f = new Fila();

        f.enqueue(new Node(5));
        f.enqueue(new Node(3));

        f.dequeue();
    }

}