Click or drag to resize

EventIndexableGraph Class

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.
Inheritance Hierarchy

Namespace:  Frontenac.Blueprints.Util.Wrappers.Event
Assembly:  VelocityGraph (in VelocityGraph.dll) Version: 10.1.0.0 (10.1)
Syntax
Copy
public class EventIndexableGraph : EventGraph, 
	IIndexableGraph, IGraph

The EventIndexableGraph type exposes the following members.

Constructors
  NameDescription
Public methodEventIndexableGraph
Initializes a new instance of the EventIndexableGraph class
Top
Methods
Extension Methods
  NameDescription
Public Extension MethodAddEdge
Add an edge to the graph with specified id and provided properties.
(Defined by GraphHelpers.)
Public Extension MethodAddUniqueVertex
Add a vertex to a graph only if no other vertex in the provided Index is indexed by the property key/value pair. If a vertex already exists with that key/value pair, return the pre-existing vertex.
(Defined by IndexableGraphHelpers.)
Public Extension MethodAddVertex
Add a vertex to the graph with specified id and provided properties.
(Defined by GraphHelpers.)
Public Extension MethodCopyGraph
Copy the vertex/edges of one graph over to another graph. The id of the elements in the from graph are attempted to be used in the to graph. This method only works for graphs where the user can control the element ids.
(Defined by GraphHelpers.)
Public Extension MethodCreateTinkerGraph (Defined by GraphHelpers.)
Public Extension MethodGraphString (Defined by StringFactory.)
Public Extension MethodLoadGml (Defined by GraphHelpers.)
Public Extension MethodLoadGraphml (Defined by GraphHelpers.)
Public Extension MethodLoadGraphson (Defined by GraphHelpers.)
Public Extension MethodReIndexElementsT
For those graphs that do no support automatic reindexing of elements when a key is provided for indexing, this method can be used to simulate that behavior. The elements in the graph are iterated and their properties (for the provided keys) are removed and then added. Be sure that the key indices have been created prior to calling this method so that they can pick up the property mutations calls. Finally, if the graph is a TransactionalGraph, then a 1000 mutation buffer is used for each commit.
(Defined by KeyIndexableGraphHelpers.)
Public Extension MethodSaveDotNet (Defined by GraphHelpers.)
Public Extension MethodSaveGml (Defined by GraphHelpers.)
Public Extension MethodSaveGraphml (Defined by GraphHelpers.)
Public Extension MethodSaveGraphson (Defined by GraphHelpers.)
Top
See Also