Find a better algorithm

[NicolasMICAUX]

Is your feature request related to a problem? Please describe.
Currently, as explained in #6, the main algorithm in _search_object is a BFS. (And we keep the information about which property/method of the object we are currently searching in with a Path of Node).

This algorithm is very simple, but does not "prioritize" some nodes in the exploration (the order of exploration is the depth of an entity in the tree of the object structure).

Describe the solution you think of
The topic is "tree exploration". There are some simple algorithms like BFS, and some fancy ones like MCTS etc.
I haven't made up my mind yet about which algorithm would be better (or if any would be).

Roadmap

• Make a comparison of the tree exploration relevant for this task, advantages and disadvantages.
• Poll/decide together if we change BFS for something else, and if so which alternative is the best.
• Implement it

Requirements/specifications

1. Fast algorithm
2. Easy to implement.
3. We may use an already implemented algorithm (like this if we were using mcts)

Importance & Difficulty
Importance: 3/5, on basic objects, searchin is already pretty fast. But may be better on some bigger objects.
Difficulty: 4/5, requires a lot of rework, testing.

Any contributor willing to co-work on this is welcome :)