A search to apply to edges when querying a graph.
This allows graph implementations to support vertex centric indexes.
In the future, this will be expanded to support more complex filters than just label and direction.
A mutable reference to an edge in a graph.
This trait extends the EdgeReference trait and provides a method to
obtain a mutable reference to the weight of the edge.
Trait to allow graphs to react to mutation of elements.
When an indexed element is updated the mutation listener is called with the index and the before and after values.
A trait that defines the basic behavior of a vertex walker, which is a specialized
type of graph walker that focuses on traversing and exploring the vertices in a graph.