Click or drag to resize

IKeyIndexableGraph Interface

A KeyIndexableGraph is a graph that supports basic index functionality around the key/value pairs of the elements of the graph. By creating key indices for a particular property key, that key is indexed on all the elements of the graph. This has ramifications for quick lookups on methods like getVertices(string, object) and getEdges(string, object).

Namespace:  Frontenac.Blueprints
Assembly:  VelocityGraph (in VelocityGraph.dll) Version: 10.1.0.0 (10.1)
Syntax
public interface IKeyIndexableGraph : IGraph

The IKeyIndexableGraph type exposes the following members.

Methods
  NameDescription
Public methodCreateKeyIndex
Create an automatic indexing structure for indexing provided key for element class.
Public methodDropKeyIndex
Remove an automatic indexing structure associated with indexing provided key for element class.
Public methodGetIndexedKeys
Return all the index keys associated with a particular element class.
Top
Extension Methods
  NameDescription
Public Extension MethodAddEdge
Add an edge to the graph with specified id and provided properties.
(Defined by GraphHelpers.)
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