Subversion Repositories programming

Rev

Show changed files | Details | Compare with Previous | Blame | RSS feed

Filtering Options

Rev Age Author Path Log message Diff
392 6831 d 6 h ira /school/cs408/p1/ PuzzleSearch.py:
* Store the current search depth with each node.

Graph.py:
* Do not create a new Vertex every time we set the value, just
change the value property.
* Add more checking to getters / setters.		  
391 6831 d 8 h ira /school/cs408/p1/ DrawGraph.py:
* Add support for getting Vertex shapes from the Graph.

PuzzleSearch.py:
* Change MAX_ITERATIONS to MAX_NODES_CREATED. It's a better metric.
* Set start and goal node shapes.

Graph.py:
* Add Vertex class to store vertex data.
* Add support for setting a Vertex's shape.		  
388 6833 d 4 h ira /school/cs408/p1/ PuzzleSearch.py:
* Add add_algorithm parameter to the GGSA.
* Add a MAX_ITERATIONS parameter to the GGSA.		  
387 6833 d 5 h ira /school/cs408/p1/ DrawGraph.py:
* Allow layout engine to be chooseable at render-time.

PuzzleSearch.py:
* Implement an 8-Puzzle specific searcher. This assumes that
each searchable node has a get_children() method.
* This implementation does not need a full Graph() to operate.
* FIXME: still only searches via BFS.
* FIXME: still has no inf-time limiter.		  
383 6835 d 4 h ira /school/cs408/ DrawGraph.py:
* Move to Project 1 directory.

Graph.py:
* Move to Project 1 directory.

GraphSearch.py:
* Move to Project 1 directory.

Generator.py:
* A basic generation class.

PuzzleGenerator.py:
* A class to generate 8Puzzles.		  
382 6835 d 4 h ira /school/cs408/ GraphSearch.py:
* Fix GraphSearch so that different algorithms can be used.		  
380 6836 d 8 h ira /school/cs408/ GraphSearch.py:
* Initial implementation of a graph searching class.
* Mostly works, colors edges taken during a search, and labels them
in the order taken.
* Needs cleanups.