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 Constructor Description ComputerAdjacentVertex(Vertex adjacentVertex)
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description Edge
addEdge(String label, Vertex inVertex, 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 anIterator
of incident edges.boolean
equals(Object other)
Vertex
getBaseVertex()
Graph
graph()
Get the graph that this element is within.int
hashCode()
Object
id()
Gets the unique identifier for the graphElement
.String
label()
Gets the label for the graphElement
which helps categorize it.<V> Iterator<VertexProperty<V>>
properties(String... propertyKeys)
Get anIterator
of properties where thepropertyKeys
is meant to be a filter on the available keys.<V> VertexProperty<V>
property(String key, V value, Object... keyValues)
Set the provided key to the provided value using defaultVertexProperty.Cardinality
for that key.<V> VertexProperty<V>
property(VertexProperty.Cardinality cardinality, String key, V value, Object... keyValues)
Create a new vertex property.void
remove()
Removes theElement
from the graph.String
toString()
Iterator<Vertex>
vertices(Direction direction, String... edgeLabels)
Gets anIterator
of adjacent vertices.
-
-
-
Constructor Detail
-
ComputerAdjacentVertex
public ComputerAdjacentVertex(Vertex adjacentVertex)
-
-
Method Detail
-
addEdge
public Edge addEdge(String label, Vertex inVertex, Object... keyValues)
Description copied from interface:Vertex
Add 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 areString
property keys and the even numbered arguments are the related property values.
-
property
public <V> VertexProperty<V> property(String key, V value, Object... keyValues)
Description copied from interface:Vertex
Set the provided key to the provided value using defaultVertexProperty.Cardinality
for 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:
property
in 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:Vertex
Create 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:
property
in 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
public Iterator<Edge> edges(Direction direction, String... edgeLabels)
Description copied from interface:Vertex
Gets anIterator
of incident edges.
-
vertices
public Iterator<Vertex> vertices(Direction direction, String... edgeLabels)
Description copied from interface:Vertex
Gets anIterator
of adjacent vertices.- Specified by:
vertices
in 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
public Object id()
Description copied from interface:Element
Gets the unique identifier for the graphElement
.
-
label
public String label()
Description copied from interface:Element
Gets the label for the graphElement
which helps categorize it.
-
graph
public Graph graph()
Description copied from interface:Element
Get the graph that this element is within.
-
remove
public void remove()
Description copied from interface:Element
Removes theElement
from the graph.
-
properties
public <V> Iterator<VertexProperty<V>> properties(String... propertyKeys)
Description copied from interface:Vertex
Get anIterator
of properties where thepropertyKeys
is meant to be a filter on the available keys. If no keys are provide then return all the properties.- Specified by:
properties
in interfaceElement
- Specified by:
properties
in interfaceVertex
-
getBaseVertex
public Vertex getBaseVertex()
- Specified by:
getBaseVertex
in interfaceWrappedVertex<Vertex>
-
-