Compare with DEAP/pymoo on synthetic tasks

Possible synthetic task for comparison is evolving graphs to match target graphs by some distance metric, like edit distance of adjacency matrix. In DEAP/pymoo this can be implemented as evolution of graph matrices.

Compare results:
- by max graph size that can be handled effectively
- by num of iterations / minutes & final metric at convergence

Having this comparison, we could understand where we're better or worse in simple tasks and where GOLEM can be improved. If the results are positive, they could be used in papers.

Implementation of graph search in GOLEM is in [this file](https://github.com/aimclub/GOLEM/tree/main/examples/synthetic_graph_evolution)