http://saiboten.com/blog/2008/11/a-simplepriorityqueue-in-java/ A web log from Tobias Rusås Olsen. Sat, 19 May 2012 03:14:10 +0000 http://wordpress.org/?v=2.5.1 http://saiboten.com/blog/2008/11/a-simplepriorityqueue-in-java/#comment-157 Arne Thu, 27 Nov 2008 14:36:42 +0000 http://saiboten.com/blog/?p=98#comment-157 I think i'd implement an empty head node which contains pointer to the first and last node in order to get faster inserting when using fifo (first in first out). you'd have to call headnode.next() to get the first, and headnode.last() to get the last node. I think i’d implement an empty head node which contains pointer to the first and last node in order to get faster inserting when using fifo (first in first out). you’d have to call headnode.next() to get the first, and headnode.last() to get the last node.

]]>