awgraph 1.0.0__tar.gz

awgraph-1.0.0/LICENSE

@@ -0,0 +1,202 @@
+
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright [yyyy] [name of copyright owner]
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

awgraph-1.0.0/PKG-INFO

@@ -0,0 +1,141 @@
+Metadata-Version: 2.4
+Name: awgraph
+Version: 1.0.0
+Summary: Semantic Python code graph — AST indexing, call graphs, and hybrid search for Python codebases.
+License: Apache-2.0
+Project-URL: Homepage, https://github.com/Aitherium/awgraph
+Project-URL: Documentation, https://github.com/Aitherium/awgraph#readme
+Project-URL: Repository, https://github.com/Aitherium/awgraph.git
+Project-URL: Issues, https://github.com/Aitherium/awgraph/issues
+Requires-Python: >=3.10
+Description-Content-Type: text/markdown
+License-File: LICENSE
+Requires-Dist: httpx>=0.25.0
+Provides-Extra: numpy
+Requires-Dist: numpy>=1.21.0; extra == "numpy"
+Provides-Extra: dev
+Requires-Dist: pytest>=7.0; extra == "dev"
+Requires-Dist: pytest-asyncio>=0.21.0; extra == "dev"
+Dynamic: license-file
+
+# awgraph — the code graph your agent reads instead of grepping
+
+An agent asked to fix a bug does not know which files matter, so it greps, opens
+whatever matched, and spends most of its context window on code it will not
+change. awgraph indexes the repository into a graph of symbols — functions,
+methods, classes, their calls and callers — and answers a natural-language task
+with the handful of chunks that task actually needs.
+
+```bash
+pip install awgraph
+```
+
+Python 3.10+. Nothing else is required to index and query.
+
+## What it costs, measured
+
+The interesting question is not "is a graph better than grep" — it is *what does
+each cost*. Measured on a corpus of real commits, where the task is a commit
+message with the answer filenames stripped out and the truth is the set of files
+that commit actually modified:
+
+| retriever | recall@10 | context tokens per task |
+|---|---|---|
+| ranked multi-term grep | 0.933 | 351,369 |
+| **awgraph** | **0.800** | **1,503** |
+
+**86% of grep's recall for 0.43% of the context — a 234x reduction.**
+
+Read that honestly: **grep still wins on recall.** awgraph is not a better
+*finder*; it is a dramatically cheaper one, and on a long agent loop the context
+budget is usually what runs out first. If you need maximum recall and cost is no
+object, grep. If you are paying per token across thousands of turns, this is a
+different order of magnitude.
+
+Caveats, because a benchmark without them is marketing: n=15 tasks, and only
+33.3% of chunks carried embeddings on that run, so the semantic half was working
+at partial strength — the recall number understates it.
+
+A naive fusion (run the graph, fall back to grep when it returns few files) was
+also measured: it reaches grep's 0.933 recall at 352,872 tokens — *more* than
+grep alone, because the fallback fires on nearly every task and pays both bills.
+Reported because it did not work; a smarter trigger is future work.
+
+## Setup: index once, embed lazily
+
+Two costs, and only one of them scales with repo size.
+
+| step | 2,400 chunks | 43,730 chunks |
+|---|---|---|
+| parse + index | 49.8s | 75.5s |
+| embed (CPU) | — | ~97 min at ~450 vectors/min |
+
+**Indexing is close to size-insensitive** — 27x the files for 1.5x the time,
+because parsing runs across workers. Embedding is the part that hurts on CPU, so
+it is optional, cached and incremental: re-indexing reuses stored vectors and
+only embeds what changed.
+
+Without any embedding backend, queries fall back to keyword scoring and still
+work. **That fallback is silent by design and dangerous by nature** — a graph
+with no vectors looks like a working graph that is merely worse. Check coverage
+rather than assuming it:
+
+```python
+embedded = sum(1 for c in graph.chunks.values() if c.embedding is not None)
+print(f"{embedded}/{len(graph.chunks)} chunks carry vectors")
+```
+
+## Use it
+
+```python
+import asyncio
+from awgraph import CodeGraph
+
+async def main():
+    graph = CodeGraph(root_path="/abs/path/to/repo", auto_index=False)
+    await graph.index_codebase("/abs/path/to/repo")   # absolute path required
+
+    for chunk in await graph.hybrid_query("retry with exponential backoff", max_results=5):
+        print(chunk.name, chunk.source_path, chunk.start_line)
+
+asyncio.run(main())
+```
+
+`index_codebase` needs an **absolute** path. Given a relative one it walks
+nothing, indexes zero chunks, and returns successfully — so assert on
+`len(graph.chunks)` rather than on the absence of an exception.
+
+The query does not need to contain the symbol name. Asking for "backoff policy
+for flaky calls" against a class documented as *"Backoff policy for flaky
+calls"* returns it by meaning, not by string match.
+
+## Where it sits
+
+Three packages, three different questions about the same repository:
+
+- **[awgit](https://github.com/Aitherium/awgit)** — semantic version control.
+  Stable node ids, semantic edit-ops, leases so concurrent agents do not
+  overwrite each other, stacked commits with one PR each. It knows **what
+  changed and who is editing it**.
+- **awgraph** — code intelligence. Symbols, call paths, dependencies, blast
+  radius. It knows **what the code is and what depends on what**.
+- **[aither-adk](https://github.com/Aitherium/aither-adk)** — the agent runtime
+  that consumes both.
+
+The seam is the useful part: awgit tells you a commit touched
+`RetryPolicy.next_delay`; awgraph tells you what calls it and which tests cover
+it; the agent reads that instead of the repository.
+
+## Related work
+
+[GitNexus](https://github.com/abhigyanpatwari/GitNexus) is the closest analogue
+and worth reading. Its recommended mode augments grep with graph context rather
+than replacing grep — a conclusion these measurements independently reach. Note
+its licence is PolyForm Noncommercial (source-available, commercial use
+forbidden), where awgraph is Apache 2.0. Its published figures measure SWE-bench
+task resolution; the numbers above measure retrieval recall. Those are different
+axes and should not be compared directly.
+
+## Licence
+
+Apache 2.0.

awgraph-1.0.0/README.md

@@ -0,0 +1,121 @@
+# awgraph — the code graph your agent reads instead of grepping
+
+An agent asked to fix a bug does not know which files matter, so it greps, opens
+whatever matched, and spends most of its context window on code it will not
+change. awgraph indexes the repository into a graph of symbols — functions,
+methods, classes, their calls and callers — and answers a natural-language task
+with the handful of chunks that task actually needs.
+
+```bash
+pip install awgraph
+```
+
+Python 3.10+. Nothing else is required to index and query.
+
+## What it costs, measured
+
+The interesting question is not "is a graph better than grep" — it is *what does
+each cost*. Measured on a corpus of real commits, where the task is a commit
+message with the answer filenames stripped out and the truth is the set of files
+that commit actually modified:
+
+| retriever | recall@10 | context tokens per task |
+|---|---|---|
+| ranked multi-term grep | 0.933 | 351,369 |
+| **awgraph** | **0.800** | **1,503** |
+
+**86% of grep's recall for 0.43% of the context — a 234x reduction.**
+
+Read that honestly: **grep still wins on recall.** awgraph is not a better
+*finder*; it is a dramatically cheaper one, and on a long agent loop the context
+budget is usually what runs out first. If you need maximum recall and cost is no
+object, grep. If you are paying per token across thousands of turns, this is a
+different order of magnitude.
+
+Caveats, because a benchmark without them is marketing: n=15 tasks, and only
+33.3% of chunks carried embeddings on that run, so the semantic half was working
+at partial strength — the recall number understates it.
+
+A naive fusion (run the graph, fall back to grep when it returns few files) was
+also measured: it reaches grep's 0.933 recall at 352,872 tokens — *more* than
+grep alone, because the fallback fires on nearly every task and pays both bills.
+Reported because it did not work; a smarter trigger is future work.
+
+## Setup: index once, embed lazily
+
+Two costs, and only one of them scales with repo size.
+
+| step | 2,400 chunks | 43,730 chunks |
+|---|---|---|
+| parse + index | 49.8s | 75.5s |
+| embed (CPU) | — | ~97 min at ~450 vectors/min |
+
+**Indexing is close to size-insensitive** — 27x the files for 1.5x the time,
+because parsing runs across workers. Embedding is the part that hurts on CPU, so
+it is optional, cached and incremental: re-indexing reuses stored vectors and
+only embeds what changed.
+
+Without any embedding backend, queries fall back to keyword scoring and still
+work. **That fallback is silent by design and dangerous by nature** — a graph
+with no vectors looks like a working graph that is merely worse. Check coverage
+rather than assuming it:
+
+```python
+embedded = sum(1 for c in graph.chunks.values() if c.embedding is not None)
+print(f"{embedded}/{len(graph.chunks)} chunks carry vectors")
+```
+
+## Use it
+
+```python
+import asyncio
+from awgraph import CodeGraph
+
+async def main():
+    graph = CodeGraph(root_path="/abs/path/to/repo", auto_index=False)
+    await graph.index_codebase("/abs/path/to/repo")   # absolute path required
+
+    for chunk in await graph.hybrid_query("retry with exponential backoff", max_results=5):
+        print(chunk.name, chunk.source_path, chunk.start_line)
+
+asyncio.run(main())
+```
+
+`index_codebase` needs an **absolute** path. Given a relative one it walks
+nothing, indexes zero chunks, and returns successfully — so assert on
+`len(graph.chunks)` rather than on the absence of an exception.
+
+The query does not need to contain the symbol name. Asking for "backoff policy
+for flaky calls" against a class documented as *"Backoff policy for flaky
+calls"* returns it by meaning, not by string match.
+
+## Where it sits
+
+Three packages, three different questions about the same repository:
+
+- **[awgit](https://github.com/Aitherium/awgit)** — semantic version control.
+  Stable node ids, semantic edit-ops, leases so concurrent agents do not
+  overwrite each other, stacked commits with one PR each. It knows **what
+  changed and who is editing it**.
+- **awgraph** — code intelligence. Symbols, call paths, dependencies, blast
+  radius. It knows **what the code is and what depends on what**.
+- **[aither-adk](https://github.com/Aitherium/aither-adk)** — the agent runtime
+  that consumes both.
+
+The seam is the useful part: awgit tells you a commit touched
+`RetryPolicy.next_delay`; awgraph tells you what calls it and which tests cover
+it; the agent reads that instead of the repository.
+
+## Related work
+
+[GitNexus](https://github.com/abhigyanpatwari/GitNexus) is the closest analogue
+and worth reading. Its recommended mode augments grep with graph context rather
+than replacing grep — a conclusion these measurements independently reach. Note
+its licence is PolyForm Noncommercial (source-available, commercial use
+forbidden), where awgraph is Apache 2.0. Its published figures measure SWE-bench
+task resolution; the numbers above measure retrieval recall. Those are different
+axes and should not be compared directly.
+
+## Licence
+
+Apache 2.0.

awgraph-1.0.0/awgraph/__init__.py

@@ -0,0 +1,70 @@
+"""awgraph — Semantic Python Code Graph.
+
+A lightweight, portable Python AST indexer with call graphs, embeddings support,
+and hybrid keyword+semantic search. Originally developed as part of AitherOS's
+CodeGraph faculty, now available as a public package.
+
+## What it does
+
+- Real AST parsing (not regex)
+- Extracts functions, classes, and methods into chunks
+- Builds call graphs (what calls what, what's called by what)
+- Hybrid search: keyword (FTS5) + semantic (embeddings)
+- SQLite storage with WAL mode for concurrent access
+- Optional NumPy for fast vector operations
+
+## What it doesn't do
+
+- PDFs, web pages, or "universal" anything — just Python code
+- Embeddings by default — bring your own or use plugin hooks
+- Network access by default — embeddings API must be provided externally
+- Persistence across instances — in-memory by design; SQLite for durability
+
+## Usage
+
+```python
+from awgraph import CodeGraph
+
+# Create an indexer
+graph = CodeGraph()
+
+# Index a directory
+await graph.index_codebase("/path/to/code")
+
+# Query
+chunks = await graph.query("rate limiter", limit=10)
+
+for chunk in chunks:
+    print(f"{chunk.name}: {chunk.calls}")
+```
+
+## Architecture
+
+- **graph.py**: CodeGraph engine, AST parsing, call graphs, chunking
+- **store.py**: SQLite+FTS5 backend for storage and search
+- **registry.py**: Multi-root manager for indexing external repos
+- **base.py**: Minimal faculty graph base class
+- **logging.py**: Standard Python logging shim
+- **degradation.py**: Optional dependency tracking
+
+Plugin support via awgraph.plugins (not yet public).
+"""
+
+from __future__ import annotations
+
+from awgraph.graph import CodeGraph, CodeChunk
+from awgraph.registry import CodeGraphRegistry, get_codegraph_registry
+from awgraph.store import CodeGraphStore
+from awgraph.base import BaseFacultyGraph, GraphSyncConfig
+
+__version__ = "1.0.0"
+
+__all__ = [
+    "CodeGraph",
+    "CodeChunk",
+    "CodeGraphRegistry",
+    "CodeGraphStore",
+    "BaseFacultyGraph",
+    "GraphSyncConfig",
+    "get_codegraph_registry",
+]

awgraph-1.0.0/awgraph/base.py

@@ -0,0 +1,139 @@
+"""
+Minimal base class for awgraph.
+
+Provides the core interface a faculty graph implements, without the AitherOS
+integrations (sync, provenance, integrity). This is what the public package
+exposes.
+"""
+
+from __future__ import annotations
+
+from dataclasses import dataclass
+from typing import Any, Dict, List
+
+
+@dataclass
+class GraphSyncConfig:
+    """Stub for compatibility; sync is not available in the public package."""
+    enabled: bool = False
+    domain: str = ""
+    batch_size: int = 20
+    flush_interval: float = 5.0
+    source_graph: str = ""
+    provenance: bool = False
+    provenance_node_type: str = "claim"
+
+
+class BaseFacultyGraph:
+    """
+    Minimal base class for a faculty graph.
+
+    In AitherOS, this also provides sync to AitherKnowledgeGraph, provenance
+    emission, and integrity tracking. The public package drops those features,
+    keeping only the core interface: query(), stats(), and graph_query().
+    """
+
+    _sync_config: GraphSyncConfig = GraphSyncConfig()
+    _scope_level: str = "platform"
+
+    def __init__(self):
+        self._sync_config = GraphSyncConfig()
+
+    def _queue_sync(self, node_data: Dict[str, Any], tenant_id: str = "platform") -> None:
+        """No-op: sync to AitherKnowledgeGraph is not available in public package."""
+        pass
+
+    def _queue_deletion(self, node_id: str, tenant_id: str = "platform") -> None:
+        """No-op: sync is not available in public package."""
+        pass
+
+    # SYNC on purpose: every call site is `self._flush_to_bus()` with no await.
+    # Declaring it async made each call return a coroutine nobody awaits, which
+    # Python reports only as a RuntimeWarning — so the no-op would have looked
+    # like it ran while doing nothing, in a package whose whole promise is that
+    # the stub is inert rather than silently broken.
+    def _flush_to_bus(self, *args: Any, **kwargs: Any) -> None:
+        """No-op: there is no event bus in the standalone package.
+
+        This one is not decoration. Indexing calls it, so omitting it made the
+        package import cleanly and then die with AttributeError on the FIRST
+        index_codebase() call — the shape where a vendored package looks fine to
+        every import check and is broken for the person who pip-installed it.
+        An import test cannot catch this; only actually indexing something can.
+
+        Subclasses in a host application may override it to re-attach their own
+        event plumbing; nothing here needs to know that they exist.
+        """
+        return None
+
+    def _emit_provenance(
+        self,
+        node_id: str,
+        name: str,
+        properties: Dict[str, Any],
+        tenant_id: str = "platform",
+    ) -> None:
+        """No-op: provenance emission is not available in public package."""
+        pass
+
+    def graph_stats(self) -> Dict[str, Any]:
+        """Inventory: how many nodes does this graph hold?
+
+        Subclasses may override. Default derives counts from public attributes.
+        """
+        entities: Dict[str, int] = {}
+        for name, val in vars(self).items():
+            if name.startswith("_") or name.startswith("by_"):
+                continue
+            if not isinstance(val, (dict, list, set, tuple)):
+                continue
+            entities[name] = len(val)
+        return {"nodes": sum(entities.values()), "containers": entities}
+
+    async def graph_query(
+        self, text: str, limit: int = 10,
+    ) -> List[Dict[str, Any]]:
+        """Uniform cross-graph query.
+
+        Adapts this graph's search() or query() method by parameter name.
+        Subclasses may override for a better native path.
+        """
+        import asyncio
+        import inspect
+
+        fn = getattr(self, "search", None) or getattr(self, "query", None)
+        if not callable(fn):
+            return []
+
+        try:
+            sig = inspect.signature(fn)
+        except (TypeError, ValueError):
+            return []
+
+        # Bind by parameter name (not position)
+        kwargs = {}
+        for p in sig.parameters.values():
+            if p.name in ("query", "query_str", "text", "prompt", "search"):
+                kwargs[p.name] = text
+            elif p.name in ("limit", "max_results", "top_k", "k"):
+                kwargs[p.name] = limit
+
+        # Call sync or async
+        try:
+            if asyncio.iscoroutinefunction(fn):
+                return await fn(**kwargs)
+            else:
+                loop = asyncio.get_event_loop()
+                return await loop.run_in_executor(None, fn, **kwargs)
+        except TypeError:
+            # Fall back to no kwargs if binding failed
+            try:
+                if asyncio.iscoroutinefunction(fn):
+                    return await fn(text, limit)
+                else:
+                    loop = asyncio.get_event_loop()
+                    return await loop.run_in_executor(None, lambda: fn(text, limit))
+            except Exception:
+                return []
+        except Exception:
+            return []