| Class and Description |
|---|
| CloseableIterable
A CloseableIterable is required where it is necessary to deallocate resources from an Iterable.
|
| Compare
Compare is a predicate that determines whether the first argument is ==, !=, >, >=, <, <= to the second argument.
|
| Contains
Contains is a predicate that evaluates whether the first object is contained within (or not within) the second collection object.
|
| Direction
Direction is used to denote the direction of an edge or location of a vertex on an edge.
|
| Edge
An Edge links two vertices.
|
| Element
An Element is the base class for both vertices and edges.
|
| Features
Features provides a listing of the features/qualities/quirks associated with any Graph implementation.
|
| Graph
A Graph is a container object for a collection of vertices and a collection edges.
|
| GraphQuery |
| Index
An Index maintains a mapping between some key/value pair and an element.
|
| Parameter
A Parameter is simply a pair of objects of type K and of type V.
|
| Predicate
A general interface for all enumerations that represent comparable operations.
|
| Query |
| Query.Compare
Deprecated.
|
| TransactionalGraph
A transactional graph supports the notion of transactions.
|
| TransactionalGraph.Conclusion
Deprecated.
|
| Vertex
A vertex maintains pointers to both a set of incoming and outgoing edges.
|
| VertexQuery
A VertexQuery object defines a collection of filters and modifiers that are used to intelligently select edges from a vertex.
|
| Class and Description |
|---|
| Edge
An Edge links two vertices.
|
| Element
An Element is the base class for both vertices and edges.
|
| Features
Features provides a listing of the features/qualities/quirks associated with any Graph implementation.
|
| Graph
A Graph is a container object for a collection of vertices and a collection edges.
|
| GraphQuery |
| Index
An Index maintains a mapping between some key/value pair and an element.
|
| IndexableGraph
An IndexableGraph is a graph that supports the manual indexing of its elements.
|
| KeyIndexableGraph
A KeyIndexableGraph is a graph that supports basic index functionality around the key/value pairs of the elements of the graph.
|
| Parameter
A Parameter is simply a pair of objects of type K and of type V.
|
| Vertex
A vertex maintains pointers to both a set of incoming and outgoing edges.
|
| Class and Description |
|---|
| CloseableIterable
A CloseableIterable is required where it is necessary to deallocate resources from an Iterable.
|
| Direction
Direction is used to denote the direction of an edge or location of a vertex on an edge.
|
| Edge
An Edge links two vertices.
|
| Element
An Element is the base class for both vertices and edges.
|
| Graph
A Graph is a container object for a collection of vertices and a collection edges.
|
| GraphQuery |
| Index
An Index maintains a mapping between some key/value pair and an element.
|
| IndexableGraph
An IndexableGraph is a graph that supports the manual indexing of its elements.
|
| Predicate
A general interface for all enumerations that represent comparable operations.
|
| Query |
| Query.Compare
Deprecated.
|
| TransactionalGraph
A transactional graph supports the notion of transactions.
|
| Vertex
A vertex maintains pointers to both a set of incoming and outgoing edges.
|
| VertexQuery
A VertexQuery object defines a collection of filters and modifiers that are used to intelligently select edges from a vertex.
|
| Class and Description |
|---|
| Element
An Element is the base class for both vertices and edges.
|
| Class and Description |
|---|
| Graph
A Graph is a container object for a collection of vertices and a collection edges.
|
| Class and Description |
|---|
| Graph
A Graph is a container object for a collection of vertices and a collection edges.
|
| Class and Description |
|---|
| Edge
An Edge links two vertices.
|
| Element
An Element is the base class for both vertices and edges.
|
| Graph
A Graph is a container object for a collection of vertices and a collection edges.
|
| Vertex
A vertex maintains pointers to both a set of incoming and outgoing edges.
|
| Class and Description |
|---|
| Direction
Direction is used to denote the direction of an edge or location of a vertex on an edge.
|
| Edge
An Edge links two vertices.
|
| Graph
A Graph is a container object for a collection of vertices and a collection edges.
|
| GraphQuery |
| Predicate
A general interface for all enumerations that represent comparable operations.
|
| Query |
| Query.Compare
Deprecated.
|
| Vertex
A vertex maintains pointers to both a set of incoming and outgoing edges.
|
| VertexQuery
A VertexQuery object defines a collection of filters and modifiers that are used to intelligently select edges from a vertex.
|
| Class and Description |
|---|
| Edge
An Edge links two vertices.
|
| Element
An Element is the base class for both vertices and edges.
|
| Features
Features provides a listing of the features/qualities/quirks associated with any Graph implementation.
|
| Graph
A Graph is a container object for a collection of vertices and a collection edges.
|
| GraphQuery |
| TransactionalGraph
A transactional graph supports the notion of transactions.
|
| TransactionalGraph.Conclusion
Deprecated.
|
| Vertex
A vertex maintains pointers to both a set of incoming and outgoing edges.
|
| Class and Description |
|---|
| Vertex
A vertex maintains pointers to both a set of incoming and outgoing edges.
|
| Class and Description |
|---|
| CloseableIterable
A CloseableIterable is required where it is necessary to deallocate resources from an Iterable.
|
| Direction
Direction is used to denote the direction of an edge or location of a vertex on an edge.
|
| Edge
An Edge links two vertices.
|
| Element
An Element is the base class for both vertices and edges.
|
| Features
Features provides a listing of the features/qualities/quirks associated with any Graph implementation.
|
| Graph
A Graph is a container object for a collection of vertices and a collection edges.
|
| GraphQuery |
| Index
An Index maintains a mapping between some key/value pair and an element.
|
| IndexableGraph
An IndexableGraph is a graph that supports the manual indexing of its elements.
|
| Parameter
A Parameter is simply a pair of objects of type K and of type V.
|
| TransactionalGraph
A transactional graph supports the notion of transactions.
|
| TransactionalGraph.Conclusion
Deprecated.
|
| Vertex
A vertex maintains pointers to both a set of incoming and outgoing edges.
|
| VertexQuery
A VertexQuery object defines a collection of filters and modifiers that are used to intelligently select edges from a vertex.
|
| Class and Description |
|---|
| Edge
An Edge links two vertices.
|
| Graph
A Graph is a container object for a collection of vertices and a collection edges.
|
| Vertex
A vertex maintains pointers to both a set of incoming and outgoing edges.
|
| Class and Description |
|---|
| CloseableIterable
A CloseableIterable is required where it is necessary to deallocate resources from an Iterable.
|
| Direction
Direction is used to denote the direction of an edge or location of a vertex on an edge.
|
| Edge
An Edge links two vertices.
|
| Element
An Element is the base class for both vertices and edges.
|
| Features
Features provides a listing of the features/qualities/quirks associated with any Graph implementation.
|
| Graph
A Graph is a container object for a collection of vertices and a collection edges.
|
| GraphQuery |
| Index
An Index maintains a mapping between some key/value pair and an element.
|
| IndexableGraph
An IndexableGraph is a graph that supports the manual indexing of its elements.
|
| KeyIndexableGraph
A KeyIndexableGraph is a graph that supports basic index functionality around the key/value pairs of the elements of the graph.
|
| Parameter
A Parameter is simply a pair of objects of type K and of type V.
|
| TransactionalGraph
A transactional graph supports the notion of transactions.
|
| TransactionalGraph.Conclusion
Deprecated.
|
| Vertex
A vertex maintains pointers to both a set of incoming and outgoing edges.
|
| VertexQuery
A VertexQuery object defines a collection of filters and modifiers that are used to intelligently select edges from a vertex.
|
| Class and Description |
|---|
| Direction
Direction is used to denote the direction of an edge or location of a vertex on an edge.
|
| Edge
An Edge links two vertices.
|
| Element
An Element is the base class for both vertices and edges.
|
| Features
Features provides a listing of the features/qualities/quirks associated with any Graph implementation.
|
| Graph
A Graph is a container object for a collection of vertices and a collection edges.
|
| GraphQuery |
| Index
An Index maintains a mapping between some key/value pair and an element.
|
| IndexableGraph
An IndexableGraph is a graph that supports the manual indexing of its elements.
|
| Parameter
A Parameter is simply a pair of objects of type K and of type V.
|
| Vertex
A vertex maintains pointers to both a set of incoming and outgoing edges.
|
| VertexQuery
A VertexQuery object defines a collection of filters and modifiers that are used to intelligently select edges from a vertex.
|
| Class and Description |
|---|
| Direction
Direction is used to denote the direction of an edge or location of a vertex on an edge.
|
| Edge
An Edge links two vertices.
|
| Element
An Element is the base class for both vertices and edges.
|
| Features
Features provides a listing of the features/qualities/quirks associated with any Graph implementation.
|
| Graph
A Graph is a container object for a collection of vertices and a collection edges.
|
| GraphQuery |
| Index
An Index maintains a mapping between some key/value pair and an element.
|
| IndexableGraph
An IndexableGraph is a graph that supports the manual indexing of its elements.
|
| KeyIndexableGraph
A KeyIndexableGraph is a graph that supports basic index functionality around the key/value pairs of the elements of the graph.
|
| Parameter
A Parameter is simply a pair of objects of type K and of type V.
|
| Vertex
A vertex maintains pointers to both a set of incoming and outgoing edges.
|
| VertexQuery
A VertexQuery object defines a collection of filters and modifiers that are used to intelligently select edges from a vertex.
|
| Class and Description |
|---|
| Direction
Direction is used to denote the direction of an edge or location of a vertex on an edge.
|
| Edge
An Edge links two vertices.
|
| Element
An Element is the base class for both vertices and edges.
|
| Features
Features provides a listing of the features/qualities/quirks associated with any Graph implementation.
|
| Graph
A Graph is a container object for a collection of vertices and a collection edges.
|
| GraphQuery |
| Index
An Index maintains a mapping between some key/value pair and an element.
|
| IndexableGraph
An IndexableGraph is a graph that supports the manual indexing of its elements.
|
| Parameter
A Parameter is simply a pair of objects of type K and of type V.
|
| Vertex
A vertex maintains pointers to both a set of incoming and outgoing edges.
|
| VertexQuery
A VertexQuery object defines a collection of filters and modifiers that are used to intelligently select edges from a vertex.
|
Copyright © 2010-2014. All Rights Reserved.