Adding new algo for going through edges

Instead of brute force algo, only nodes with hamming less than 3 are
permutated and checked for.
Gives a code boost of about a factor of ~300 times.
Fixed a bug in decompile Union Find
Adding few modifications and result file
Adding fix for duplicate nodes
Adding multimap to handle duplicate nodes
Adding support for nodes(even more than 2 copies)

listofDuplicates is mantained and merged with hamming 1 and 2.
Adding memory free calls

Code memory cleaning implemented
Code clean up
Merge branch 'dev_perm' into master_toMerge

Conflicts:
	src/Clustering.cpp