Struct GraphAnalysisLimits 

pub struct GraphAnalysisLimits { /* private fields */ }

How much work one analysis of one graph may cost.

A graph describes a repository someone else supplied, so every superlinear operation and every indexed allocation is admitted against a stated ceiling first. There is no default: an interactive editor, a CI job, and a batch run have different acceptable budgets, and a library that picked one would make that policy implicit.

Implementations

impl GraphAnalysisLimits

pub fn new( max_nodes: u32, max_selected_edges: u32, max_depth: u32, max_betweenness_work: u64, ) -> Self

Ceilings for the admitted node count, the admitted selected-edge count, the depth one query may walk, and the betweenness work bound.

pub fn max_nodes(self) -> u32

The node ceiling analysis construction refuses above.

pub fn max_selected_edges(self) -> u32

The selected-edge ceiling analysis construction refuses above.

pub fn max_depth(self) -> u32

The depth ceiling a neighborhood or subgraph query refuses above.

pub fn max_betweenness_work(self) -> u64

The betweenness work bound centrality refuses above.

Trait Implementations

impl Clone for GraphAnalysisLimits

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for GraphAnalysisLimits

impl Debug for GraphAnalysisLimits

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

Formats the value using the given formatter.

impl Eq for GraphAnalysisLimits

impl PartialEq for GraphAnalysisLimits

fn eq(&self, other: &Self) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl StructuralPartialEq for GraphAnalysisLimits