Struct LazyGraphRAGConfig 

pub struct LazyGraphRAGConfig {
    pub use_concept_extraction: bool,
    pub min_concept_length: usize,
    pub max_concept_words: usize,
    pub co_occurrence_threshold: usize,
    pub use_query_refinement: bool,
    pub max_refinement_iterations: usize,
    pub use_bidirectional_index: bool,
}

LazyGraphRAG configuration Concept-based retrieval without prior summarization (Microsoft Research, 2025) Achieves 0.1% of full GraphRAG indexing cost and 700x cheaper query costs

Fields

use_concept_extraction: bool

Enable concept extraction (noun phrases without LLM)

min_concept_length: usize

Minimum concept length in characters

max_concept_words: usize

Maximum concept length in words

co_occurrence_threshold: usize

Co-occurrence threshold (minimum shared chunks for relationship)

use_query_refinement: bool

Enable query refinement with iterative deepening

max_refinement_iterations: usize

Maximum refinement iterations

use_bidirectional_index: bool

Enable bidirectional entity-chunk indexing for fast lookups

Trait Implementations

impl Clone for LazyGraphRAGConfig

fn clone(&self) -> LazyGraphRAGConfig

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for LazyGraphRAGConfig

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Default for LazyGraphRAGConfig

fn default() -> Self

Returns the “default value” for a type.

impl<'de> Deserialize<'de> for LazyGraphRAGConfig

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Serialize for LazyGraphRAGConfig

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.