Source/sink & Path-planning

[thefangbear]

Add path-planning menu option, allowing player to specify source/sink location

Alternatively, allow player to specify certain prizes along the way.

This is preferably done separate from the monsters first. Later we can add support for dynamic replanning to avoid monsters.

[thefangbear]

We're doing the OOP approach:

• Wrote a deque implementation, called Queue
• Wrote a pairing heap implementation, called PriorityQueue

Next:

• Implement BFS / Dijkstra
• Investigate using bidirectional search to speed up search?

[thefangbear]

OK, so BFS is now implemented (minimum functionality), but Dijkstra has a problem...

1. We need to maintain the size of priority queue after modifications (this is not yet done)
2. The basic unit for doing Dijkstra is an edge coming out of a node (i,j). We need to initialize the basecase edges properly using a loop through (i,j)'s incident edges.
   Now:

• Incident edges can either be determined through the get_weight function, or through the actual maze with a designated color.

[thefangbear]

OK, so BFS is now implemented (minimum functionality), but Dijkstra has a problem...

1. We need to maintain the size of priority queue after modifications (this is not yet done)

2. The basic unit for doing Dijkstra is an edge coming out of a node (i,j). We need to initialize the basecase edges properly using a loop through (i,j)'s incident edges.
   Now:


* Incident edges can either be determined through the `get_weight` function, or through the actual maze with a designated color.

See ef64bd0