Some local search algorithms can continue when no better result was found, if there is possibility of a later improvement, if iterations limit was specified (if not, stop)
Up minor version
Added basic dummy and console viewers, at this moment just with traditional search support
Traditional search support for viewers
Viewer can be specified on all the traditional search algorithms
Viewers have a start() method (will need it for the web viewer)
Simple proof of concept of WebViewer based on ConsoleViewer (same output, web-based)
Web viewer code reorganized (not functions inside functions, wait for next before redirect, not 100% cpu waiting)
WebViewer can specify host and port to listen
Usage of template for web viewer
WebViewer is ConsoleViewer with different pause and output :)
Call ConsoleViewer init
Storing last events information, will need it to build the graph
Interactive-awesomeness to the console viewer: quit, run to end, save graph (place holder)
Saving state on the console viewer, so it will be able to create graphs
Better prompt logic (loop until has to continue execution)
Basic (sample) graph creation
Empty option is correct (continue)
The viewer receives a list of nodes, not fifolist or other list types
Viewer calls only when viewer is used. Don't call a dummy viewer