Trait that captures the contents of a node if it's matched.
Trait to match dependency graph edges.
A representation of a match of a pattern in a graph.
Abstract superclass for all matchers.
Trait to match dependency graph nodes.
Represents a pattern with which graphs can be searched.
Always match any node.
Represents a pattern with which graphs can be searched. A pattern will start and end with a node matcher, and every matcher (necessarily) alternates between a NodeMatcher and and EdgeMatcher.