Method search_graph

agent/src/opentrace_agent/store/graph_store.py:636–673

Search nodes then expand their neighborhood via BFS. Returns (nodes, relationships).

(
        self,
        query: str,
        hops: int = 2,
        limit: int = 50,
    )

        return nodes

    def search_graph(
        self,
        query: str,
        hops: int = 2,
        limit: int = 50,
    ) -> tuple[list[dict[str, Any]], list[dict[str, Any]]]:
        """Search nodes then expand their neighborhood via BFS.

        Returns (nodes, relationships).
        """
        hops = max(0, min(hops, 5))

        match_nodes = self.search_nodes(query, limit=limit)
        if not match_nodes:
            return [], []

        node_map: dict[str, dict[str, Any]] = {}
        rel_map: dict[str, dict[str, Any]] = {}

        for n in match_nodes:
            node_map[n["id"]] = n

        if hops > 0:
            for n in match_nodes:
                traversal = self.traverse(n["id"], direction="both", max_depth=hops)
                for t in traversal:
                    nid = t["node"]["id"]
                    if nid not in node_map:
                        node_map[nid] = t["node"]
                    rid = t["relationship"]["id"]
                    if rid not in rel_map:
                        rel_map[rid] = t["relationship"]
        else:
            # hops=0: return only relationships between matched nodes
            for r in self.list_relationships_for_nodes(set(node_map.keys()), limit * 2):
                rel_map[r["id"]] = r

        return list(node_map.values()), list(rel_map.values())

    # -- traversal -------------------------------------------------------