Open
Conversation
b232043 to
ce7fc3f
Compare
ce7fc3f to
315397c
Compare
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
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
54023f4Thanks @davidkpiano! - Add edge weights, A* pathfinding, subgraph extraction, and graph reversal.weight?: numberon edges; algorithms default to(e) => e.weight ?? 1with BFS fast path when unweightedgetAStarPath(graph, { from, to, heuristic })for heuristic-guided shortest pathsgetSubgraph(graph, nodeIds)returns induced subgraph with internal edgesreverseGraph(graph, filterEdge?)flips edge directions8f9912dThanks @davidkpiano! - Add walk generators and coverage utilities for model-based testing.genRandomWalk(),genWeightedRandomWalk(),genQuickRandomWalk(),genPredefinedWalk()— step-by-step graph traversal generators that yieldGraphStep, with optionalseedfor deterministic replaytakeSteps(),takeUntilNode(),takeUntilEdge(),takeUntilNodeCoverage(),takeUntilEdgeCoverage()getCoverage()computes node/edge coverage stats from a walkfilteroption for edge guards,onStepcallback for actions — keeps graph JSON-serializablePatch Changes
22f77a5Thanks @davidkpiano! - Fix schema and GraphML serialization drift, optimize weighted graph algorithms, and makegenSimplePaths()truly lazy.weighttoEdgeSchemaand tighten schema drift tests against the runtime graph typesinitialNodeId,direction,style, geometry, and edgeweightgenSimplePaths()to yield incrementally instead of collecting all paths before returning