public ArrayList getPathFromRoot() { Node current = this; AbstractQueue queue = new AbstractQueue(); while (!(current.isRootNode())) { queue.addToFront(current); current = current.getParent(); } queue.addToFront(current); // take care of root node return(queue.asList()); }
public ToArrayEnumerator(AbstractQueue <T> queue) { _queue = queue; Initialize(); }
public JosephusSolver(AbstractQueue <int> q) { queue = q; }