Main example for priority queue using dijkstra's algorithm.

I wanted to have a slightly larger example compared to the method examples, but I'm unsure how it worked out.

Feedback would nice.
You could combine these two with `let mut dist = Vec::from_elem(adj_list.len(), uint::MAX);`