VelocityGraph.Frontenac.Blueprints.Util.Wrappers.Event Namespace

An edge with a GraphChangedListener attached. Those listeners are notified when changes occur to the properties of the edge.

A sequence of edges that applies the list of listeners into each edge.

An element with a GraphChangedListener attached. Those listeners are notified when changes occur to the properties of the element.

An eventInnerTinkerGrapĥ is a wrapper to existing Graph implementations and provides for graph events to be raised to one or more listeners on changes to the Graph. Notifications to the listeners occur for the following events: new vertex/edge, vertex/edge property changed, vertex/edge property removed, vertex/edge removed. The limiting factor to events being raised is related to out-of-process functions changing graph elements. To gather events from eventInnerTinkerGrapĥ, simply provide an implementation of the {@link GraphChangedListener} to the eventInnerTinkerGrapĥ by utilizing the addListener method. eventInnerTinkerGrapĥ allows the addition of multiple GraphChangedListener implementations. Each listener will be notified in the order that it was added.

An index that wraps graph elements in the "evented" way. This class does not directly raise graph events, but passes the GraphChangedListener to the edges and vertices returned from indices so that they may raise graph events.

EventIndexableGraph is merely a proxy to index methods exposing eventInnerTinkerGrapĥ methods in the "evented" way. Like the eventInnerTinkerGrapĥ it extends from, this graph implementations raise notifications to the listeners for the following events: new vertex/edge, vertex/edge property changed, vertex/edge property removed, vertex/edge removed.

The transactional and indexable implementation of eventInnerTinkerGrapĥ where events are raised in batch in the order they changes occured to the graph, but only after a successful commit to the underlying graph.

An vertex with a GraphChangedListener attached. Those listeners are notified when changes occur to the properties of the vertex.

A sequence of vertices that applies the list of listeners into each vertex.