[Haskell-cafe] shortest paths, prioritiy queues

Ross Paterson ross at soi.city.ac.uk
Wed Dec 24 08:58:51 EST 2008

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.

More information about the Haskell-Cafe mailing list