Skip to content

Version Packages#11

Open
github-actions[bot] wants to merge 1 commit intomainfrom
changeset-release/main
Open

Version Packages#11
github-actions[bot] wants to merge 1 commit intomainfrom
changeset-release/main

Conversation

@github-actions
Copy link
Contributor

@github-actions github-actions bot commented Mar 9, 2026

This PR was opened by the Changesets release GitHub action. When you're ready to do a release, you can merge this and the packages will be published to npm automatically. If you're not ready to do a release yet, that's fine, whenever you add more changesets to main, this PR will be updated.

Releases

@statelyai/graph@0.6.0

Minor Changes

  • 54023f4 Thanks @davidkpiano! - Add edge weights, A* pathfinding, subgraph extraction, and graph reversal.

    • weight?: number on edges; algorithms default to (e) => e.weight ?? 1 with BFS fast path when unweighted
    • getAStarPath(graph, { from, to, heuristic }) for heuristic-guided shortest paths
    • getSubgraph(graph, nodeIds) returns induced subgraph with internal edges
    • reverseGraph(graph, filterEdge?) flips edge directions
    • Remove stale TODO for Mermaid sequence blocks (already implemented)
  • 8f9912d Thanks @davidkpiano! - Add walk generators and coverage utilities for model-based testing.

    • genRandomWalk(), genWeightedRandomWalk(), genQuickRandomWalk(), genPredefinedWalk() — step-by-step graph traversal generators that yield GraphStep, with optional seed for deterministic replay
    • Composable stop conditions: takeSteps(), takeUntilNode(), takeUntilEdge(), takeUntilNodeCoverage(), takeUntilEdgeCoverage()
    • getCoverage() computes node/edge coverage stats from a walk
    • filter option for edge guards, onStep callback for actions — keeps graph JSON-serializable

Patch Changes

  • 22f77a5 Thanks @davidkpiano! - Fix schema and GraphML serialization drift, optimize weighted graph algorithms, and make genSimplePaths() truly lazy.

    • add weight to EdgeSchema and tighten schema drift tests against the runtime graph types
    • preserve graph, node, and edge metadata in GraphML round-trips, including initialNodeId, direction, style, geometry, and edge weight
    • use a heap-backed priority queue for weighted shortest paths, A*, and Prim MST
    • refactor genSimplePaths() to yield incrementally instead of collecting all paths before returning

@github-actions github-actions bot force-pushed the changeset-release/main branch 2 times, most recently from b232043 to ce7fc3f Compare March 14, 2026 02:57
@github-actions github-actions bot force-pushed the changeset-release/main branch from ce7fc3f to 315397c Compare March 15, 2026 09:56
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

0 participants