shortest path with Haskell

[Keith Wansbrough]

> Hi every one !
> I have a big problem with implementation the
> Dijkstra's shortest path with Haskell .the condition
> is it must be implemented with priority queue using
> list (or tree).Any of yo have the code for this ? I
> really 
> really needs for help !!!
> thankssssssss a lot!!!!!!
> pham

I suggest you ask your instructor/lecturer, or consult your textbook.

--KW 8-)
-- 
Keith Wansbrough <kw217@cl.cam.ac.uk>
http://www.cl.cam.ac.uk/users/kw217/
University of Cambridge Computer Laboratory.