Method edge_from_entry

masfactory/components/graphs/graph.py:203–228

Create an edge from internal entry to `receiver`.

(self,
            receiver: Node,
            keys: dict[str,dict|str]|None=None)

        return self._exit.output.copy()
    
    def edge_from_entry(self,
            receiver: Node,
            keys: dict[str,dict|str]|None=None):
        """Create an edge from internal entry to `receiver`."""
        if receiver is not self._exit:
            receiver_node = self._nodes.get(receiver.name)
            if receiver_node is None:
                raise ValueError(
                    f"Receiver node '{receiver.name}' not found in graph '{self.name}'"
                )
            if receiver_node is not receiver:
                raise ValueError(
                    f"Receiver node instance mismatch for '{receiver.name}' in graph '{self.name}'"
                )

        for existing in self._entry.out_edges:
            if existing._receiver is receiver:
                raise ValueError(
                    f"duplicate edge: {self._entry.name} -> {receiver.name} already exists in graph '{self.name}'"
                )

        edge = Edge(self._entry, receiver, keys)
        self._edges.append(edge)
        self._entry.add_out_edge(edge)
        receiver.add_in_edge(edge)
        return edge

    def edge_to_exit(self,
            sender: Node,