v0.0.3
Graph Protocol Hierarchy & Algorithms
This release adds a protocol-based graph API with comprehensive algorithms, following the same @runtime_checkable capability pattern as the filesystem layer.
Highlights
GraphStoreprotocol + 7 capability protocols —SupportsCentrality,SupportsConnectivity,SupportsTraversal,SupportsSubgraph,SupportsFiltering,SupportsNodeSimilarity,SupportsPersistence- Graph algorithms — PageRank, betweenness/closeness/katz/degree centrality, connected components, ancestors/descendants, topological sort, shortest paths
- Subgraph extraction —
neighborhood(),meeting_subgraph()(connecting subgraph with PageRank scoring),common_reachable() - Filtering & similarity —
find_nodes()with callable predicates,find_edges(), Jaccard node similarity SubgraphResult— Frozen dataclass with deep immutability (tuple+MappingProxyType)- Public API —
GraphStoreandSubgraphResultexported fromgrover; convenience wrappers onGrover/GroverAsync
Breaking Changes
Graphrenamed toRustworkxGraph(no alias)GroverAsync.graphis now a public attribute typedGraphStore(wasself._graph)SentenceTransformerProvideralias removed — useSentenceTransformerEmbedding
Full Changelog: v0.0.2...v0.0.3