The implementation relies on the existing byLLM implementation. The underlying function of choosing where to go next is built using byLLM.
The syntax should look like
Which will arrange the visitor queue according to semantic information of the walker, current node and connected nodes.