Find the route

This is my first game and it's is a type of puzzle. The purpose of the game is to visit all the nodes connected and return to the start point. Summarizing, find a Hamiltonian cycle.

For this, it's necessary to visit all the nodes and couldn't go back, only go ahead. When it couldn't be continued, the only option is restart the level.

At this moment the game has 120 levels and 10 levels without lines that I have called Phantom levels. I'm writing new levels with more nodes but at the same time, I am also considering change to Eulerian cycles in next levels.
I hope you find it entertaining.

Enjoy it!!