Click or drag to resize

IIndexableGraph Interface

An IIndexableGraph is a graph that supports the manual indexing of its elements. An index is typically some sort of tree structure that allows for the fast lookup of elements by key/value pairs. Indices have an Index object associated with them and allow the user to specify the putting and getting of elements into the index.

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

The IIndexableGraph type exposes the following members.

Public methodCreateIndex
Generate an index with a particular name for a particular class.
Public methodDropIndex
Remove an index associated with the graph.
Public methodGetIndex
Get an index from the graph by its name and index class. An index is unique up to name.
Public methodGetIndices
Get all the indices maintained by the graph.
Extension Methods
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.)
See Also