Public Types
using	Predicate = std::function< bool(typename GraphType::NodeRef)>

Public Member Functions
	MatchPredicate (const Predicate &criteria)

	MatchPredicate (const MatchPredicate &)=default

MatchPredicate &	operator= (const MatchPredicate &)=default

	MatchPredicate (MatchPredicate &&)=default

Predicate	getCriteria () const

int	getCount () const

MatchPredicate< GraphType > &	count (int count)

MatchPredicate< GraphType > &	starCount ()

MatchPredicate< GraphType > &	nonTerminal ()

MatchPredicate< GraphType > &	excludeFromSubgraph ()

bool	isNonTerminal () const

bool	shouldIncludeInSubgraph () const

std::string	getDebugString () const

void	setDebugString (const std::string &debugString)

Detailed Description

MatchPredicate needs a predicate for node matching and

includeInSubgraph: whether this node and nodes/edges reachable from it should be included in the return matched subgraph (if the pattern matches). This is useful in case we would like to specify a matching pattern but do not want part of the pattern to be included in the returned subgraph.
A count, which means we may want to match this node multiple times from its incoming edges. The count can be unlimited (think about it as a regex star).
If nonTerminal flag is set, it means we will not consider outgoing edges from the node when doing subgraph matching.

Definition at line 32 of file SubgraphMatcher.h.

The documentation for this class was generated from the following file:

Public Types