Module graph 

Re-exports

pub use algorithms::astar;

pub use algorithms::dijkstra;

pub use algorithms::k_core;

pub use algorithms::louvain;

pub use algorithms::modularity;

pub use algorithms::scc;

pub use builder::AttributeMode;

pub use builder::TraversalBuilder;

pub use edge::EdgeAssertion;

pub use subgraph::EdgeRef;

pub use subgraph::NodeData;

pub use subgraph::Subgraph;

pub use vector_filter::CandidateCount;

pub use vector_filter::CostEstimate;

pub use vector_filter::CostEstimator;

pub use vector_filter::FilteredVectorSearch;

pub use vector_filter::VectorFilterStrategy;

Modules

algorithms

In-memory graph algorithms operating on a loaded Subgraph (§5.4).

builder

edge

subgraph

The in-memory graph loaded from links_current, and its loader (§5.4).

vector_filter

Filtered vector search: strategies, the byte-budget cost model, and the planner that chooses between them (§5.3, D-007).