Hi everyone , I am trying to utilise LLMSynonymRetriever in order to check for existing nodes in my graph and if they do not create a new node but rather utilise an existing one. I am having a hard understanding how it scores the nodes and also the parameter for max_depth , my question is the new node that is about to be inserted is not connected to the graph, so how does it determine how deep to walk into the graph since the node is not connected ?
