Definition: A policy that items are processed in order of arrival. A queue implements this.
See also last-in, first-out.
Note: Same as first come, first served. A breadth-first search checks newly encountered nodes first-in, first-out. Often written as FIFO.
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 17 December 2004.
HTML page formatted Fri Mar 25 16:20:34 2011.
Cite this as:
Paul E. Black, "first-in, first-out", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed., U.S. National Institute of Standards and Technology. 17 December 2004. (accessed TODAY) Available from: http://www.nist.gov/dads/HTML/firstinfrstt.html