pub struct GMatch<'a> {
pub pattern: GraphPattern,
pub graph: &'a str,
pub score: f64,
}Expand description
GMatch_P (Definition 2.2.2 / 5.2.2): subgraph-isomorphism pattern
matching via backtracking with arc-consistency candidate pruning,
MRV (minimum remaining values) variable ordering, and a negated-edge
post-filter. Each match maps each pattern variable to a vertex id;
the result is a GraphPostingList keyed on a synthetic 1-based
match id, with the assignment carried as payload fields.
Fields§
§pattern: GraphPattern§graph: &'a str§score: f64Implementations§
Source§impl<'a> GMatch<'a>
impl<'a> GMatch<'a>
pub fn new(pattern: GraphPattern, graph: &'a str) -> Self
pub fn execute<G: GraphStore>( &self, store: &G, ) -> GraphStoreResult<GraphPostingList>
Auto Trait Implementations§
impl<'a> !RefUnwindSafe for GMatch<'a>
impl<'a> !UnwindSafe for GMatch<'a>
impl<'a> Freeze for GMatch<'a>
impl<'a> Send for GMatch<'a>
impl<'a> Sync for GMatch<'a>
impl<'a> Unpin for GMatch<'a>
impl<'a> UnsafeUnpin for GMatch<'a>
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more