shortest path with Haskell

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 __________________________________________________ Do You Yahoo!? Everything you'll ever need on one web page from News and Sport to Email and Music Charts http://uk.my.yahoo.com