public final class TinkerVertex extends TinkerElement implements Vertex
Vertex.Exceptions| Modifier and Type | Field and Description |
|---|---|
protected Map<String,Set<Edge>> |
inEdges |
protected Map<String,Set<Edge>> |
outEdges |
protected Map<String,List<VertexProperty>> |
properties |
id, label, removedDEFAULT_LABEL, EMPTY_ARGS| Modifier | Constructor and Description |
|---|---|
protected |
TinkerVertex(Object id,
String label,
TinkerGraph graph) |
| Modifier and Type | Method and Description |
|---|---|
Edge |
addEdge(String label,
Vertex vertex,
Object... keyValues)
Add an outgoing edge to the vertex with provided label and edge properties as key/value pairs.
|
Iterator<Edge> |
edges(Direction direction,
String... edgeLabels)
Gets an
Iterator of incident edges. |
Graph |
graph()
Get the graph that this element is within.
|
Set<String> |
keys()
Get the keys of the properties associated with this element.
|
<V> Iterator<VertexProperty<V>> |
properties(String... propertyKeys)
Get an
Iterator of properties where the propertyKeys is meant to be a filter on the available
keys. |
<V> VertexProperty<V> |
property(String key)
Get the
VertexProperty for the provided key. |
<V> VertexProperty<V> |
property(VertexProperty.Cardinality cardinality,
String key,
V value,
Object... keyValues)
Create a new vertex property.
|
void |
remove()
Removes the
Element from the graph. |
String |
toString() |
Iterator<Vertex> |
vertices(Direction direction,
String... edgeLabels)
Gets an
Iterator of adjacent vertices. |
elementAlreadyRemoved, equals, hashCode, id, labelclone, finalize, getClass, notify, notifyAll, wait, wait, waitid, label, value, valuesgetHostingVertexprotected Map<String,List<VertexProperty>> properties
protected TinkerVertex(Object id, String label, TinkerGraph graph)
public Graph graph()
Elementpublic <V> VertexProperty<V> property(String key)
VertexVertexProperty for the provided key. If the property does not exist, return
VertexProperty.empty(). If there are more than one vertex properties for the provided
key, then throw Vertex.Exceptions.multiplePropertiesExistForProvidedKey(java.lang.String).public <V> VertexProperty<V> property(VertexProperty.Cardinality cardinality, String key, V value, Object... keyValues)
VertexVertexProperty.Cardinality.single, then set the key
to the value. If the cardinality is VertexProperty.Cardinality.list, then add a new value to the key.
If the cardinality is VertexProperty.Cardinality.set, then only add a new value if that value doesn't
already exist for the key. If the value already exists for the key, add the provided key value vertex property
properties to it.property in interface VertexV - the type of the value of the vertex propertycardinality - the desired cardinality of the property keykey - the key of the vertex propertyvalue - The value of the vertex propertykeyValues - the key/value pairs to turn into vertex property propertiespublic Set<String> keys()
ElementHashSet.public Edge addEdge(String label, Vertex vertex, Object... keyValues)
VertexString
property keys and the even numbered arguments are the related property values.public void remove()
ElementElement from the graph.public Iterator<Edge> edges(Direction direction, String... edgeLabels)
VertexIterator of incident edges.public Iterator<Vertex> vertices(Direction direction, String... edgeLabels)
VertexIterator of adjacent vertices.vertices in interface Vertexdirection - The adjacency direction of the vertices to retrieve off this vertexedgeLabels - The labels of the edges associated with the vertices to retrieve. If no labels are provided,
then get all edges.public <V> Iterator<VertexProperty<V>> properties(String... propertyKeys)
VertexIterator of properties where the propertyKeys is meant to be a filter on the available
keys. If no keys are provide then return all the properties.properties in interface Elementproperties in interface VertexCopyright © 2013–2022 Apache Software Foundation. All rights reserved.