Main example for priority queue using dijkstra's algorithm.

[treeman]

I wanted to have a slightly larger example compared to the method examples, but I'm unsure how it worked out.

Feedback would nice.

[steveklabnik]

bikeshed alert: wonder if this shouldn't be a full position instead. It's not that much longer.

[steveklabnik]

I really like this idea.

[treeman]

Great! Thanks for the pointers.

[huonw]

This could be

loop {
    let State { position, cost } = match pq.pop() {
        None => break, // empty
        Some(s) => s
    };

    // ...
}

[alexcrichton]

This is a fantastic example, nice job!

This looks good to go with two minor comments and some squashings, thanks!

[treeman]

Cool, thanks!