code: def _see_remote_link_node(self, node_id, fringe=None, dist=None,
                                check_dsp=lambda x: True):
          
          # Namespace shortcut.
          node, p_id, c_i = self.nodes[node_id], self.index[:-1], self.index[-1:]
  
          if node['type'] == 'data' and p_id and check_dsp(p_id):
              sol = self.sub_sol[self.index[:-1]]  # Get parent solution.
              for dsp_id, n in sol.dsp.nodes.items():
                  if n['index'] == c_i and node_id in n.get('outputs', {}):
                      value = self[node_id]  # Get data output.
                      for n_id in stlp(n['outputs'][node_id]):
                          # Node has been visited or inp do not coincide with out.
                          if not (n_id in sol._visited or
                                  sol.workflow.has_edge(n_id, dsp_id)):
                              # Donate the result to the child.
                              sol._wf_add_edge(dsp_id, n_id, value=value)
                              if fringe is not None:
                                  # See node.
                                  sol._see_node(n_id, fringe, dist, w_wait_in=2)
                      break
docs: See data remote links of the node (set output to remote links).
  
          :param node_id:
              Node id.
          :type node_id: str
  
          :param fringe:
              Heapq of closest available nodes.
          :type fringe: list[(float | int, bool, (str, Dispatcher)]
  
          :param dist:
              Distance from the starting node.
          :type dist: float, int
  
          :param check_dsp:
              A function to check if the remote dispatcher is ok.
          :type check_dsp: (Dispatcher) -> bool