[Haskell-cafe] shortest paths, prioritiy queues

[Lennart Augustsson]

Fair enough.

On Wed, Dec 24, 2008 at 2:58 PM, Ross Paterson <ross at soi.city.ac.uk> wrote:
> On Wed, Dec 24, 2008 at 02:27:26PM +0100, Lennart Augustsson wrote:
>> Couldn't Data.Sequence be augmented with the PSQ operations?
>
> Data.Fingertree could be specialized as a PSQ, but I don't see how
> Data.Sequence could.  Insertion would be O((log n)^2), and would also
> change the position of items in the sequence.
> _______________________________________________
> Haskell-Cafe mailing list
> Haskell-Cafe at haskell.org
> http://www.haskell.org/mailman/listinfo/haskell-cafe
>