htmlgraph 0.27.2__py3-none-any.whl → 0.27.3__py3-none-any.whl

htmlgraph/query_composer.py

@@ -0,0 +1,509 @@
+from __future__ import annotations
+
+"""
+Graph Query Composer for HtmlGraph.
+
+Extends QueryBuilder capabilities with graph traversal, enabling queries
+that combine attribute filtering WITH edge traversal.
+
+Example:
+    from htmlgraph import HtmlGraph
+
+    graph = HtmlGraph("features/")
+
+    # Find blocked features whose blockers are high-priority
+    results = graph.query_composer() \\
+        .where("status", "blocked") \\
+        .traverse("blocked_by", direction="outgoing") \\
+        .where("priority", "high") \\
+        .execute()
+
+    # Find all features transitively reachable via depends_on from a root
+    results = graph.query_composer() \\
+        .reachable_from("feat-001", "depends_on") \\
+        .where("status", "todo") \\
+        .execute()
+"""
+
+from collections import deque
+from dataclasses import dataclass, field
+from typing import TYPE_CHECKING, Any, Literal
+
+from htmlgraph.query_builder import Condition, LogicalOp, Operator
+
+if TYPE_CHECKING:
+    from htmlgraph.graph import HtmlGraph
+    from htmlgraph.models import Node
+
+
+# Sentinel object to distinguish "no value passed" from None
+_SENTINEL: Any = object()
+
+
+@dataclass
+class QueryStage:
+    """A single stage in the query execution pipeline."""
+
+    stage_type: Literal["filter", "traverse", "traverse_recursive", "reachable_from"]
+    params: dict[str, Any] = field(default_factory=dict)
+
+
+class GraphQueryComposer:
+    """
+    Composes graph traversal with attribute filtering.
+
+    Wraps QueryBuilder condition logic and EdgeIndex traversal into
+    a pipeline of stages. Each stage narrows the working set of nodes.
+
+    Example:
+        composer = GraphQueryComposer(graph)
+        results = composer \\
+            .where("status", "blocked") \\
+            .traverse("blocked_by") \\
+            .where("priority", "high") \\
+            .execute()
+    """
+
+    def __init__(self, graph: HtmlGraph) -> None:
+        self.graph = graph
+        self._stages: list[QueryStage] = []
+        # Accumulate filter conditions for the current filter group.
+        # When a traverse stage is added, pending conditions are flushed
+        # into a filter stage.
+        self._pending_conditions: list[Condition] = []
+
+    # ------------------------------------------------------------------
+    # Attribute filtering (delegates to QueryBuilder condition logic)
+    # ------------------------------------------------------------------
+
+    def where(self, attr: str, value: Any = _SENTINEL) -> GraphQueryComposer:
+        """Start or add an attribute filter on the current node set.
+
+        Args:
+            attr: Attribute name (supports dot notation for nested access).
+            value: If provided, shorthand for equality check.
+
+        Returns:
+            Self for chaining.
+        """
+        if value is not _SENTINEL:
+            self._pending_conditions.append(
+                Condition(
+                    attribute=attr,
+                    operator=Operator.EQ,
+                    value=value,
+                    logical_op=LogicalOp.AND,
+                )
+            )
+        else:
+            # When no value is given, add a placeholder condition that must
+            # be completed by a subsequent operator call.  For simplicity
+            # we store an IS_NOT_NULL condition which acts as a "has attr"
+            # check; callers who want other operators should use and_/or_.
+            self._pending_conditions.append(
+                Condition(
+                    attribute=attr,
+                    operator=Operator.IS_NOT_NULL,
+                    value=None,
+                    logical_op=LogicalOp.AND,
+                )
+            )
+        return self
+
+    def and_(self, attr: str, value: Any = _SENTINEL) -> GraphQueryComposer:
+        """Add an AND condition.
+
+        Args:
+            attr: Attribute name.
+            value: If provided, shorthand for equality check.
+
+        Returns:
+            Self for chaining.
+        """
+        if value is not _SENTINEL:
+            self._pending_conditions.append(
+                Condition(
+                    attribute=attr,
+                    operator=Operator.EQ,
+                    value=value,
+                    logical_op=LogicalOp.AND,
+                )
+            )
+        else:
+            self._pending_conditions.append(
+                Condition(
+                    attribute=attr,
+                    operator=Operator.IS_NOT_NULL,
+                    value=None,
+                    logical_op=LogicalOp.AND,
+                )
+            )
+        return self
+
+    def or_(self, attr: str, value: Any = _SENTINEL) -> GraphQueryComposer:
+        """Add an OR condition.
+
+        Args:
+            attr: Attribute name.
+            value: If provided, shorthand for equality check.
+
+        Returns:
+            Self for chaining.
+        """
+        if value is not _SENTINEL:
+            self._pending_conditions.append(
+                Condition(
+                    attribute=attr,
+                    operator=Operator.EQ,
+                    value=value,
+                    logical_op=LogicalOp.OR,
+                )
+            )
+        else:
+            self._pending_conditions.append(
+                Condition(
+                    attribute=attr,
+                    operator=Operator.IS_NOT_NULL,
+                    value=None,
+                    logical_op=LogicalOp.OR,
+                )
+            )
+        return self
+
+    # ------------------------------------------------------------------
+    # Relationship traversal
+    # ------------------------------------------------------------------
+
+    def traverse(
+        self, relationship: str, direction: str = "outgoing"
+    ) -> GraphQueryComposer:
+        """Follow edges of given relationship type from current result set.
+
+        For each node in the working set, collect the nodes reachable
+        by one hop via *relationship* in the specified *direction*.
+
+        Args:
+            relationship: Edge relationship type (e.g. ``"blocked_by"``).
+            direction: ``"outgoing"``, ``"incoming"``, or ``"both"``.
+
+        Returns:
+            Self for chaining.
+        """
+        self._flush_conditions()
+        self._stages.append(
+            QueryStage(
+                stage_type="traverse",
+                params={"relationship": relationship, "direction": direction},
+            )
+        )
+        return self
+
+    def traverse_recursive(
+        self,
+        relationship: str,
+        direction: str = "outgoing",
+        max_depth: int = 10,
+    ) -> GraphQueryComposer:
+        """Follow edges recursively (transitive closure) up to *max_depth*.
+
+        Args:
+            relationship: Edge relationship type.
+            direction: ``"outgoing"``, ``"incoming"``, or ``"both"``.
+            max_depth: Maximum traversal depth.
+
+        Returns:
+            Self for chaining.
+        """
+        self._flush_conditions()
+        self._stages.append(
+            QueryStage(
+                stage_type="traverse_recursive",
+                params={
+                    "relationship": relationship,
+                    "direction": direction,
+                    "max_depth": max_depth,
+                },
+            )
+        )
+        return self
+
+    def reachable_from(
+        self,
+        node_id: str,
+        relationship: str,
+        direction: str = "outgoing",
+        max_depth: int = 10,
+    ) -> GraphQueryComposer:
+        """Filter to nodes reachable from *node_id* via *relationship*.
+
+        This resets the working set to all nodes transitively reachable
+        from the given starting node (excluding the starting node itself).
+
+        Args:
+            node_id: Starting node ID.
+            relationship: Edge relationship type.
+            direction: ``"outgoing"``, ``"incoming"``, or ``"both"``.
+            max_depth: Maximum traversal depth.
+
+        Returns:
+            Self for chaining.
+        """
+        self._flush_conditions()
+        self._stages.append(
+            QueryStage(
+                stage_type="reachable_from",
+                params={
+                    "node_id": node_id,
+                    "relationship": relationship,
+                    "direction": direction,
+                    "max_depth": max_depth,
+                },
+            )
+        )
+        return self
+
+    # ------------------------------------------------------------------
+    # Convenience methods
+    # ------------------------------------------------------------------
+
+    def blocked_by_chain(self, feature_id: str) -> GraphQueryComposer:
+        """Find all features in the ``blocked_by`` chain from *feature_id*.
+
+        Equivalent to ``reachable_from(feature_id, "blocked_by", "outgoing")``.
+
+        Args:
+            feature_id: Starting feature node ID.
+
+        Returns:
+            Self for chaining.
+        """
+        return self.reachable_from(feature_id, "blocked_by", direction="outgoing")
+
+    def dependency_chain(self, feature_id: str) -> GraphQueryComposer:
+        """Find all features in the ``depends_on`` chain from *feature_id*.
+
+        Equivalent to ``reachable_from(feature_id, "depends_on", "outgoing")``.
+
+        Args:
+            feature_id: Starting feature node ID.
+
+        Returns:
+            Self for chaining.
+        """
+        return self.reachable_from(feature_id, "depends_on", direction="outgoing")
+
+    # ------------------------------------------------------------------
+    # Execution
+    # ------------------------------------------------------------------
+
+    def execute(self) -> list[Node]:
+        """Execute all stages and return matching nodes.
+
+        Returns:
+            List of nodes matching the composed query.
+        """
+        # Flush any remaining pending conditions
+        self._flush_conditions()
+
+        self.graph._ensure_loaded()  # noqa: SLF001
+
+        # Start with all node IDs
+        working_set: set[str] = set(self.graph._nodes.keys())  # noqa: SLF001
+
+        for stage in self._stages:
+            if stage.stage_type == "filter":
+                working_set = self._apply_filter(working_set, stage)
+            elif stage.stage_type == "traverse":
+                working_set = self._apply_traverse(working_set, stage)
+            elif stage.stage_type == "traverse_recursive":
+                working_set = self._apply_traverse_recursive(working_set, stage)
+            elif stage.stage_type == "reachable_from":
+                working_set = self._apply_reachable_from(working_set, stage)
+
+        # Resolve IDs to Node objects, preserving only nodes that still exist
+        nodes = self.graph._nodes  # noqa: SLF001
+        return [nodes[nid] for nid in working_set if nid in nodes]
+
+    def count(self) -> int:
+        """Execute and return count of matches.
+
+        Returns:
+            Number of matching nodes.
+        """
+        return len(self.execute())
+
+    def first(self) -> Node | None:
+        """Execute and return first match or ``None``.
+
+        Returns:
+            First matching node or ``None``.
+        """
+        results = self.execute()
+        return results[0] if results else None
+
+    def ids(self) -> list[str]:
+        """Execute and return just node IDs.
+
+        Returns:
+            List of matching node IDs.
+        """
+        return [node.id for node in self.execute()]
+
+    # ------------------------------------------------------------------
+    # Internal helpers
+    # ------------------------------------------------------------------
+
+    def _flush_conditions(self) -> None:
+        """Flush accumulated conditions into a filter stage."""
+        if self._pending_conditions:
+            self._stages.append(
+                QueryStage(
+                    stage_type="filter",
+                    params={"conditions": list(self._pending_conditions)},
+                )
+            )
+            self._pending_conditions = []
+
+    def _apply_filter(self, working_set: set[str], stage: QueryStage) -> set[str]:
+        """Apply attribute filter conditions to the working set."""
+        conditions: list[Condition] = stage.params["conditions"]
+        nodes = self.graph._nodes  # noqa: SLF001
+        result: set[str] = set()
+
+        for nid in working_set:
+            node = nodes.get(nid)
+            if node is None:
+                continue
+            if self._evaluate_conditions(node, conditions):
+                result.add(nid)
+
+        return result
+
+    def _apply_traverse(self, working_set: set[str], stage: QueryStage) -> set[str]:
+        """Follow one hop of edges from working set."""
+        relationship: str = stage.params["relationship"]
+        direction: str = stage.params["direction"]
+        edge_index = self.graph._edge_index  # noqa: SLF001
+        result: set[str] = set()
+
+        for nid in working_set:
+            if direction in ("outgoing", "both"):
+                for ref in edge_index.get_outgoing(nid, relationship):
+                    result.add(ref.target_id)
+            if direction in ("incoming", "both"):
+                for ref in edge_index.get_incoming(nid, relationship):
+                    result.add(ref.source_id)
+
+        return result
+
+    def _apply_traverse_recursive(
+        self, working_set: set[str], stage: QueryStage
+    ) -> set[str]:
+        """Follow edges recursively from working set with depth limit."""
+        relationship: str = stage.params["relationship"]
+        direction: str = stage.params["direction"]
+        max_depth: int = stage.params["max_depth"]
+        edge_index = self.graph._edge_index  # noqa: SLF001
+
+        result: set[str] = set()
+        # BFS from every node in working set
+        queue: deque[tuple[str, int]] = deque()
+        for nid in working_set:
+            queue.append((nid, 0))
+
+        visited: set[str] = set(working_set)
+
+        while queue:
+            current, depth = queue.popleft()
+            if depth >= max_depth:
+                continue
+
+            neighbors: set[str] = set()
+            if direction in ("outgoing", "both"):
+                for ref in edge_index.get_outgoing(current, relationship):
+                    neighbors.add(ref.target_id)
+            if direction in ("incoming", "both"):
+                for ref in edge_index.get_incoming(current, relationship):
+                    neighbors.add(ref.source_id)
+
+            for neighbor in neighbors:
+                if neighbor not in visited:
+                    visited.add(neighbor)
+                    result.add(neighbor)
+                    queue.append((neighbor, depth + 1))
+
+        return result
+
+    def _apply_reachable_from(
+        self, working_set: set[str], stage: QueryStage
+    ) -> set[str]:
+        """Compute nodes reachable from a specific node, intersected with working set."""
+        node_id: str = stage.params["node_id"]
+        relationship: str = stage.params["relationship"]
+        direction: str = stage.params["direction"]
+        max_depth: int = stage.params["max_depth"]
+        edge_index = self.graph._edge_index  # noqa: SLF001
+
+        reachable: set[str] = set()
+        visited: set[str] = {node_id}
+        queue: deque[tuple[str, int]] = deque([(node_id, 0)])
+
+        while queue:
+            current, depth = queue.popleft()
+            if depth >= max_depth:
+                continue
+
+            neighbors: set[str] = set()
+            if direction in ("outgoing", "both"):
+                for ref in edge_index.get_outgoing(current, relationship):
+                    neighbors.add(ref.target_id)
+            if direction in ("incoming", "both"):
+                for ref in edge_index.get_incoming(current, relationship):
+                    neighbors.add(ref.source_id)
+
+            for neighbor in neighbors:
+                if neighbor not in visited:
+                    visited.add(neighbor)
+                    reachable.add(neighbor)
+                    queue.append((neighbor, depth + 1))
+
+        # Intersect with the current working set
+        return working_set & reachable
+
+    @staticmethod
+    def _evaluate_conditions(node: Node, conditions: list[Condition]) -> bool:
+        """Evaluate a list of conditions against a node.
+
+        Reuses the ``Condition.evaluate`` method from ``query_builder.py``
+        so condition evaluation logic is not duplicated.
+
+        Args:
+            node: Node to evaluate.
+            conditions: Conditions to check.
+
+        Returns:
+            ``True`` if the node satisfies the combined conditions.
+        """
+        if not conditions:
+            return True
+
+        result: bool | None = None
+
+        for condition in conditions:
+            condition_result = condition.evaluate(node)
+
+            # Handle NOT operator
+            if condition.logical_op == LogicalOp.NOT:
+                condition_result = not condition_result
+
+            if result is None:
+                result = condition_result
+            elif condition.logical_op == LogicalOp.AND:
+                result = result and condition_result
+            elif condition.logical_op == LogicalOp.OR:
+                result = result or condition_result
+            elif condition.logical_op == LogicalOp.NOT:
+                # NOT combined with previous result (AND NOT)
+                result = result and condition_result
+
+        return result if result is not None else True

{htmlgraph-0.27.2.dist-info → htmlgraph-0.27.3.dist-info}/METADATA

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: htmlgraph
-Version: 0.27.2
+Version: 0.27.3
 Summary: HTML is All You Need - Graph database on web standards
 Project-URL: Homepage, https://github.com/Shakes-tzd/htmlgraph
 Project-URL: Documentation, https://github.com/Shakes-tzd/htmlgraph#readme
@@ -24,6 +24,7 @@ Requires-Dist: fastapi>=0.104.0
 Requires-Dist: jinja2>=3.1.0
 Requires-Dist: justhtml>=0.6.0
 Requires-Dist: pydantic>=2.0.0
+Requires-Dist: pyyaml>=6.0
 Requires-Dist: rich>=13.0.0
 Requires-Dist: typing-extensions>=4.0.0; python_version < '3.11'
 Requires-Dist: uvicorn>=0.24.0
@@ -38,7 +39,6 @@ Requires-Dist: pdoc>=14.0.0; extra == 'dev'
 Requires-Dist: pytest-asyncio>=0.23.0; extra == 'dev'
 Requires-Dist: pytest-cov>=4.0.0; extra == 'dev'
 Requires-Dist: pytest>=7.0.0; extra == 'dev'
-Requires-Dist: pyyaml>=6.0; extra == 'dev'
 Requires-Dist: ruff>=0.1.0; extra == 'dev'
 Requires-Dist: tomli>=2.0.0; (python_version < '3.11') and extra == 'dev'
 Provides-Extra: sqlite

{htmlgraph-0.27.2.dist-info → htmlgraph-0.27.3.dist-info}/RECORD

@@ -1,4 +1,4 @@
-htmlgraph/__init__.py,sha256=o9KEEGQ4MItTgUfBT-lXHrkqHwJpqAn-WCFql6ZEDDU,6407
+htmlgraph/__init__.py,sha256=pkSpF0qSd2RLviOruILG54FI3YUu0dHxiGtTt_vvGyA,6407
 htmlgraph/__init__.pyi,sha256=8JuFVuDll9jMx9s8ZQHt2tXic-geOJHiXUMB2YjmHhU,6683
 htmlgraph/agent_detection.py,sha256=wEmrDv4hssPX2OkEnJZBHPbalxcaloiJF_hOOow_5WE,3511
 htmlgraph/agent_registry.py,sha256=80TPYr4P0YMizPUbTH4N5wH6D84IKs-HPBLHGeeP6bY,9449
@@ -6,6 +6,7 @@ htmlgraph/agents.py,sha256=Yvu6x1nOfrW2WhRTAHiCuSpvqoVJXx1Mkzd59kwEczw,33466
 htmlgraph/analytics_index.py,sha256=fm0cnZjce2Ii4F9FQo1np_mWsFXuRgTTOzbrCJWGW3g,32793
 htmlgraph/atomic_ops.py,sha256=f0ULZoJThfC-A8xORvRv5OuFuhEnnH7uJrZslnZwmuw,18781
 htmlgraph/attribute_index.py,sha256=oF4TwbFGdtg1_W5AUJ-Ka4VcH-aYz-qldtiPvStJlfA,6594
+htmlgraph/bounded_paths.py,sha256=4HHXiT8q2fhGkrGsGrACFnDrnAzwJ-Tk_4V9h-voenM,18832
 htmlgraph/cli_framework.py,sha256=YfAjTGIECmv_uNpkenYyc9_iKd3jXIG5OstEKpIGWJM,3551
 htmlgraph/config.py,sha256=dhOSfMfZCT-APe_uAvqABWyQ0nEhL6F0NS-15KLPZNg,6888
 htmlgraph/context_analytics.py,sha256=fGuIhGCM-500wH_pTKE24k0Rl01QvQ8Kznoj61KpjiU,11345
@@ -41,10 +42,13 @@ htmlgraph/orchestrator_mode.py,sha256=DXkG89uHe2VPz8wSx44JENn70lQiI5BLihKGpcPnNx
 htmlgraph/orchestrator_validator.py,sha256=gd_KbHsRsNEIF7EElwcxbMYqOMlyeuYIZwClASp-L-E,4699
 htmlgraph/parallel.py,sha256=txiCgNtPu9hpBsIkwHHZhKBrPrdN6W3ysA9Q0_YjSa0,22419
 htmlgraph/parser.py,sha256=mPcQ3WQdDCpflhjk8397TPbHnQcU3SzefNk-JE406UA,16570
+htmlgraph/path_query.py,sha256=51ttIPsLM1RsYgRSYEpLW6lwgsFuZ9OTaIUfju3M6XU,20034
+htmlgraph/pattern_matcher.py,sha256=QOEWN5QFZqUaaTywSxLVyWsjBRUBUOjBCI7fpF7Uu8M,22161
 htmlgraph/planning.py,sha256=iqPF9mCVQwOfJ4vuqcF2Y3-yhx9koJZw0cID7CknIug,35903
 htmlgraph/pydantic_models.py,sha256=4vGAp2n59Hf8v5mZG-Tx2vOSm3lcE_PypBprcejJUXE,15832
 htmlgraph/quality_gates.py,sha256=ovPrjGgAwK5MjMzEIda4a6M5_S-yGiRJYy8KhzdyTZ0,11686
 htmlgraph/query_builder.py,sha256=GBrjf_6Qoq98JxJr8cYeAMV4QpdmrfFyadJpDjH4clM,18093
+htmlgraph/query_composer.py,sha256=ilasmZBc8_mLS1iq45Kcw2Ig1zCN04-r1HVKr8f9YP0,17332
 htmlgraph/reflection.py,sha256=agNfHsI1ynayTG3kgt5fiQj30LkG9b-v3wtnDsu4-Gk,15663
 htmlgraph/refs.py,sha256=jgsPWRTfPDxhH_dr4EeYdU1ly-e3HpuHgAPnMXMbaF4,10011
 htmlgraph/repo_hash.py,sha256=wYQlgYf0W1LfU95PA6vViA-MlUxA6ry_xDh7kyCB4v4,14888
@@ -79,6 +83,7 @@ htmlgraph/analytics/cost_reporter.py,sha256=_KumnYUYTr3yEHwBGGgjXSHR5IGPLDqjfuZH
 htmlgraph/analytics/cross_session.py,sha256=sD_i209uMdKzGhHb3sX7QCll-0E4JwZiZYlbcuNzdgo,20590
 htmlgraph/analytics/dependency.py,sha256=DhO5XGIZXg83w7wRw8QKSTRFyU0CwKvK9QixJ-PlLHU,25835
 htmlgraph/analytics/pattern_learning.py,sha256=TVP-kSzM7i9PCeNUYhxv8L4UUm37baunKzUFz0lUays,26689
+htmlgraph/analytics/session_graph.py,sha256=3zeNH3MimcSDj5j43c2OdVh42xWTPRw6iq5xdaodR2c,23197
 htmlgraph/analytics/work_type.py,sha256=fjCEbCaHEhhzp3iyOQdOd1id5SAlnc8Y5NEhP5g5hug,19413
 htmlgraph/analytics/strategic/__init__.py,sha256=qAOjBJIrZvrGg3egKIiZDW8ZHL4OqVKUTrmX1RElHZk,2103
 htmlgraph/analytics/strategic/cost_optimizer.py,sha256=X7HuBUDkPT0-4lf6uuaCXDK0N7dOGpFYyBUgRwSYwYk,19460
@@ -87,7 +92,7 @@ htmlgraph/analytics/strategic/preference_manager.py,sha256=uO8cX-kaK7EIJh-ovXh5c
 htmlgraph/analytics/strategic/suggestion_engine.py,sha256=KV43DF6PETJkmrMA_Ni34heSdQqS_GXKeeGsq5zO6ck,26093
 htmlgraph/api/__init__.py,sha256=PPFJ5QSv-Zei8U0yGOSs8dJKtUQMeloEqsxVBfzNbbA,105
 htmlgraph/api/cost_alerts_websocket.py,sha256=6e_2pKn0-Hcz2ClFyNuJEhVBffqmcUBOkbseSgSkAqQ,14839
-htmlgraph/api/main.py,sha256=K8nXSbDL6MlRvZG-6OsDxvK7QfKYEcrlEHMZeVkYDGM,98099
+htmlgraph/api/main.py,sha256=rQ9758JJ3qqabr8qmQDWuW2T7XlfnDWdRCydPyD9R6o,98121
 htmlgraph/api/websocket.py,sha256=L8a_p9cSLdmG1dcVQLZSfxS994Dm-caNPnYQWZ_a-Z0,17592
 htmlgraph/api/static/htmx.min.js,sha256=0VEHzH8ECp6DsbZhdv2SetQLXgJVgToD-Mz-7UbuQrA,48036
 htmlgraph/api/static/style-redesign.css,sha256=zp0ggDJHz81FN5SW5tRcWXPK_jVNCAJyqKhwlZkBfnQ,26759
@@ -321,12 +326,12 @@ htmlgraph/templates/AGENTS.md.template,sha256=f96h7V6ygwj-v-fanVI48eYMxR6t_se4be
 htmlgraph/templates/CLAUDE.md.template,sha256=h1kG2hTX2XYig2KszsHBfzrwa_4Cfcq2Pj4SwqzeDlM,1984
 htmlgraph/templates/GEMINI.md.template,sha256=gAGzE53Avki87BM_otqy5HdcYCoLsHgqaKjVzNzPMX8,1622
 htmlgraph/templates/orchestration-view.html,sha256=DlS7LlcjH0oO_KYILjuF1X42t8QhKLH4F85rkO54alY,10472
-htmlgraph-0.27.2.data/data/htmlgraph/dashboard.html,sha256=MUT6SaYnazoyDcvHz5hN1omYswyIoUfeoZLf2M_iblo,251268
-htmlgraph-0.27.2.data/data/htmlgraph/styles.css,sha256=oDUSC8jG-V-hKojOBO9J88hxAeY2wJrBYTq0uCwX_Y4,7135
-htmlgraph-0.27.2.data/data/htmlgraph/templates/AGENTS.md.template,sha256=f96h7V6ygwj-v-fanVI48eYMxR6t_se4bet1H4ZsDpI,7642
-htmlgraph-0.27.2.data/data/htmlgraph/templates/CLAUDE.md.template,sha256=h1kG2hTX2XYig2KszsHBfzrwa_4Cfcq2Pj4SwqzeDlM,1984
-htmlgraph-0.27.2.data/data/htmlgraph/templates/GEMINI.md.template,sha256=gAGzE53Avki87BM_otqy5HdcYCoLsHgqaKjVzNzPMX8,1622
-htmlgraph-0.27.2.dist-info/METADATA,sha256=gf4WGVLI615GAWSe6scFMb65ZgKXAVGAIPDIXD6nH8s,10236
-htmlgraph-0.27.2.dist-info/WHEEL,sha256=WLgqFyCfm_KASv4WHyYy0P3pM_m7J5L9k2skdKLirC8,87
-htmlgraph-0.27.2.dist-info/entry_points.txt,sha256=Wmdo5cx8pt6NoMsssVE2mZH1CZLSUsrg_3iSWatiyn0,103
-htmlgraph-0.27.2.dist-info/RECORD,,
+htmlgraph-0.27.3.data/data/htmlgraph/dashboard.html,sha256=MUT6SaYnazoyDcvHz5hN1omYswyIoUfeoZLf2M_iblo,251268
+htmlgraph-0.27.3.data/data/htmlgraph/styles.css,sha256=oDUSC8jG-V-hKojOBO9J88hxAeY2wJrBYTq0uCwX_Y4,7135
+htmlgraph-0.27.3.data/data/htmlgraph/templates/AGENTS.md.template,sha256=f96h7V6ygwj-v-fanVI48eYMxR6t_se4bet1H4ZsDpI,7642
+htmlgraph-0.27.3.data/data/htmlgraph/templates/CLAUDE.md.template,sha256=h1kG2hTX2XYig2KszsHBfzrwa_4Cfcq2Pj4SwqzeDlM,1984
+htmlgraph-0.27.3.data/data/htmlgraph/templates/GEMINI.md.template,sha256=gAGzE53Avki87BM_otqy5HdcYCoLsHgqaKjVzNzPMX8,1622
+htmlgraph-0.27.3.dist-info/METADATA,sha256=0pT6ydHGg3sccbKDYNDSzel1xXtjFH9-KwYnBxIQhsI,10220
+htmlgraph-0.27.3.dist-info/WHEEL,sha256=WLgqFyCfm_KASv4WHyYy0P3pM_m7J5L9k2skdKLirC8,87
+htmlgraph-0.27.3.dist-info/entry_points.txt,sha256=Wmdo5cx8pt6NoMsssVE2mZH1CZLSUsrg_3iSWatiyn0,103
+htmlgraph-0.27.3.dist-info/RECORD,,