test_trim_multi_edge() — langchain Function Reference

Architecture documentation for the test_trim_multi_edge() function in test_graph.py from the langchain codebase.

Function python LangChainCore Runnables

Entity Profile

LangChainCore→ Runnables→ test_trim_multi_edge() — langchain Function Reference

Dependency Diagram

graph TD
  8d80e936_b45e_a226_480e_39e20a4c7027["test_trim_multi_edge()"]
  83e2cebc_592b_5a1b_c581_48dfbd3d53cf["test_graph.py"]
  8d80e936_b45e_a226_480e_39e20a4c7027 -->|defined in| 83e2cebc_592b_5a1b_c581_48dfbd3d53cf
  style 8d80e936_b45e_a226_480e_39e20a4c7027 fill:#6366f1,stroke:#818cf8,color:#fff

Relationship Graph

Source Code

libs/core/tests/unit_tests/runnables/test_graph.py lines 80–99

def test_trim_multi_edge() -> None:
    class Scheme(BaseModel):
        a: str

    graph = Graph()
    start = graph.add_node(Scheme, id="__start__")
    a = graph.add_node(Scheme, id="a")
    last = graph.add_node(Scheme, id="__end__")

    graph.add_edge(start, a)
    graph.add_edge(a, last)
    graph.add_edge(start, last)

    # trim_first_node() should not remove __start__ since it has 2 outgoing edges
    graph.trim_first_node()
    assert graph.first_node() is start

    # trim_last_node() should not remove __end__ since it has 2 incoming edges
    graph.trim_last_node()
    assert graph.last_node() is last