Class ComputerGraph.ComputerAdjacentVertex
java.lang.Object
org.apache.tinkerpop.gremlin.process.computer.util.ComputerGraph.ComputerAdjacentVertex
- All Implemented Interfaces:
Element,Host,WrappedVertex<Vertex>,Vertex
- Enclosing class:
- ComputerGraph
public class ComputerGraph.ComputerAdjacentVertex
extends Object
implements Vertex, WrappedVertex<Vertex>
-
Nested Class Summary
Nested classes/interfaces inherited from interface org.apache.tinkerpop.gremlin.structure.Vertex
Vertex.Exceptions -
Field Summary
Fields inherited from interface org.apache.tinkerpop.gremlin.structure.Vertex
DEFAULT_LABEL, EMPTY_ARGS -
Constructor Summary
Constructors -
Method Summary
Modifier and TypeMethodDescriptionAdd an outgoing edge to the vertex with provided label and edge properties as key/value pairs.Gets anIteratorof incident edges.booleangraph()Get the graph that this element is within.inthashCode()id()Gets the unique identifier for the graphElement.label()Gets the label for the graphElementwhich helps categorize it.labels()Gets all labels for this element.<V> Iterator<VertexProperty<V>>properties(String... propertyKeys) Get anIteratorof properties where thepropertyKeysis meant to be a filter on the available keys.<V> VertexProperty<V>Set the provided key to the provided value using defaultVertexProperty.Cardinalityfor that key.<V> VertexProperty<V>property(VertexProperty.Cardinality cardinality, String key, V value, Object... keyValues) Create a new vertex property.voidremove()Removes theElementfrom the graph.toString()Gets anIteratorof adjacent vertices.Methods inherited from class java.lang.Object
clone, finalize, getClass, notify, notifyAll, wait, wait, wait
-
Constructor Details
-
ComputerAdjacentVertex
-
-
Method Details
-
addEdge
Description copied from interface:VertexAdd an outgoing edge to the vertex with provided label and edge properties as key/value pairs. These key/values must be provided in an even number where the odd numbered arguments areStringproperty keys and the even numbered arguments are the related property values. -
property
Description copied from interface:VertexSet the provided key to the provided value using defaultVertexProperty.Cardinalityfor that key. The default cardinality can be vendor defined and is usually tied to the graph schema. The default implementation of this method determines the cardinalitygraph().features().vertex().getCardinality(key). The provided key/values are the properties of the newly createdVertexProperty. These key/values must be provided in an even number where the odd numbered arguments areString.- Specified by:
propertyin interfaceVertex- Type Parameters:
V- the type of the value of the vertex property- Parameters:
key- the key of the vertex propertyvalue- The value of the vertex propertykeyValues- the key/value pairs to turn into vertex property properties- Returns:
- the newly created vertex property
-
property
public <V> VertexProperty<V> property(VertexProperty.Cardinality cardinality, String key, V value, Object... keyValues) Description copied from interface:VertexCreate a new vertex property. If the cardinality isVertexProperty.Cardinality.single, then set the key to the value. If the cardinality isVertexProperty.Cardinality.list, then add a new value to the key. If the cardinality isVertexProperty.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.- Specified by:
propertyin interfaceVertex- Type Parameters:
V- the type of the value of the vertex property- Parameters:
cardinality- 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 properties- Returns:
- the newly created vertex property
-
edges
Description copied from interface:VertexGets anIteratorof incident edges. -
vertices
Description copied from interface:VertexGets anIteratorof adjacent vertices.- Specified by:
verticesin interfaceVertex- Parameters:
direction- 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.- Returns:
- An iterator of vertices meeting the provided specification
-
id
Description copied from interface:ElementGets the unique identifier for the graphElement. -
label
Description copied from interface:ElementGets the label for the graphElementwhich helps categorize it. -
labels
Description copied from interface:ElementGets all labels for this element.For
Vertex: may return zero or more labels (multi-label support). ForEdge: returns a singleton set (single label only in TinkerGraph). ForVertexProperty: returns a singleton set containing the property key. -
graph
Description copied from interface:ElementGet the graph that this element is within. -
remove
public void remove()Description copied from interface:ElementRemoves theElementfrom the graph. -
properties
Description copied from interface:VertexGet anIteratorof properties where thepropertyKeysis meant to be a filter on the available keys. If no keys are provide then return all the properties.- Specified by:
propertiesin interfaceElement- Specified by:
propertiesin interfaceVertex
-
hashCode
public int hashCode() -
toString
-
equals
-
getBaseVertex
- Specified by:
getBaseVertexin interfaceWrappedVertex<Vertex>
-