algorithms for solving a couple of common graph data structures tasks

1. Movement project - solution for finding all eulerian paths in a directed graph
2. Tree project - solution for finding node's right neighbour in a tree