Struct MatchQuery 

pub struct MatchQuery<'a> { /* private fields */ }

Builder pattern for configuring subgraph matching queries.

This provides a fluent API for setting options and collecting results.

Implementations

impl<'a> MatchQuery<'a>

pub fn new(pattern: &'a Graph, target: &'a Graph) -> Self

Create a new match query with default options.

pub fn with_options(self, opts: VF3Options) -> Self

Configure the matching options.

pub fn node_induced(self) -> Self

Set node-induced matching (default).

pub fn edge_induced(self) -> Self

Set edge-induced matching.

pub fn undirected(self) -> Self

Treat graphs as undirected.

pub fn with_node_labels(self) -> Self

Enable node label checking.

pub fn with_edge_labels(self) -> Self

Enable edge label checking.

pub fn limit(self, max: usize) -> Self

Limit the maximum number of matches to find.

pub fn collect(self) -> Vec<NodeMapping>

Collect all matches (up to the limit if set).

pub fn count(self) -> usize

Count the total number of matches.

pub fn first(self) -> Option<NodeMapping>

Find the first match, if any.

pub fn exists(self) -> bool

Check if any match exists (subgraph isomorphism test).

pub fn iter(self) -> LazyDfsIter<'a>

Create an iterator over all matches.

pub fn prepared(self) -> Prepared<'a>

Use prepared search for better performance with repeated queries.