Plots all graphs as separated images.

The algorithm is correct, but way too slow. A prunning strategy is required.
major rewrite from Match documentation (haddock style)
corrected some tabs
more comment adjustments (separating interface doc from internal description)
Fix bug in main.
Merge branch 'master' of github.com:rodrigo-machado/ufrgs-grt
NodeConditions (trying new approach)

Doing major changes in conditions, to make them more abstract and
capable of handling more complicated constraints. The idea is to
propagate new conditions along with new mappings through the algorithm.
It's for now restricted to the node matching algorithm, but I might apply
the same idea to edges.
Now we have a danglingCondGen and a delCondGen

Names might change, but in essence we have now a matching algorithm
that handles two cases:
	- delCondGen: avoids a node marked to be deleted to be mapped
		to another one.
	- danglingCondGen: avoids a node with an edge pointing from/to it
		to be deleted.
removed old node mappings funcs
Commented delCondGen. Important TODO added.

TODO: Need to add a new condition to guarantee that any node already
mapped doesn't get marked to be deleted. Currently, the condition only
check if a node marked to be deleted doesn't get remapped.
Merge and change state-space to something simpler.