Skip to main contentModule graph
Source - CostEstimate
- One planning decision, with the arithmetic that produced it (D-007).
- CostEstimator
- Byte-budget cost model estimator for vector filter strategies (§5.3, D-007).
- EdgeAssertion
- Edge assertion builder for assert / retire / re-assert lifecycle operations.
- EdgeRef
- One end of an edge in an adjacency list — interned (0.8.0, B2, D-115).
- FilteredVectorSearch
- A vector search restricted to the nodes a traversal reaches (§5.3).
- NodeData
- The attributes of one node, as of the instant the graph was loaded.
- Subgraph
- A transient, in-memory graph loaded from
links_current. - TraversalBuilder
- Recursive CTE traversal query builder (§5.2).
- AttributeMode
- Attribute hydration mode for temporal traversals (§5.2).
- CandidateCount
- What the counting probe learned about the candidate set.
- VectorFilterStrategy
- Strategy for combining vector search and graph traversal filters (§5.3).
- DEFAULT_BYTE_BUDGET
- Default ceiling on the candidate set, in bytes.
- DEFAULT_PROBE_CAP
- Default cap on the counting probe.
- astar
- A* search from
start to goal (§5.4). - dijkstra
- Dijkstra’s algorithm for shortest path distances (§5.4).
- k_core
- k-core decomposition: the maximal induced subgraph in which every node has
degree at least
k (§5.4). - louvain
- Louvain community detection, local-moving phase (§5.4).
- modularity
- Newman-Girvan modularity of a partition, treating the graph as undirected.
- scc
- Strongly connected components by Kosaraju’s algorithm (§5.4).
- validate_edge_type
- Edge types are
[A-Z0-9]+ (§4.1).