Speed-up isomorphism search a bit

Filter feasible assignments also by degree. This drastically reduces
search space and speeds up algorithm by a factor of 7 on simple graphs.
Fix match and replace algorithms

Previous versions did not take into consideration that only closed nodes
are completelly removed from state graph while open nodes retain
connections that are not in matched subgraph.