public class ComputerGraph.ComputerAdjacentVertex extends Object implements Vertex, WrappedVertex<Vertex>
Vertex.ExceptionsDEFAULT_LABEL, EMPTY_ARGS| Constructor and Description | 
|---|
| ComputerAdjacentVertex(Vertex adjacentVertex) | 
| Modifier and Type | Method and 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 an  Iteratorof 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 graph  Element. | 
| String | label()Gets the label for the graph  Elementwhich helps categorize it. | 
| <V> Iterator<VertexProperty<V>> | properties(String... propertyKeys)Get an  Iteratorof properties where thepropertyKeysis 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 default  VertexProperty.Cardinalityfor that key. | 
| <V> VertexProperty<V> | property(VertexProperty.Cardinality cardinality,
        String key,
        V value,
        Object... keyValues)Create a new vertex property. | 
| void | remove()Removes the  Elementfrom the graph. | 
| String | toString() | 
| Iterator<Vertex> | vertices(Direction direction,
        String... edgeLabels)Gets an  Iteratorof adjacent vertices. | 
clone, finalize, getClass, notify, notifyAll, wait, wait, waitgetHostingVertexpublic ComputerAdjacentVertex(Vertex adjacentVertex)
public Edge addEdge(String label, Vertex inVertex, Object... keyValues)
VertexString
 property keys and the even numbered arguments are the related property values.public <V> VertexProperty<V> property(String key, V value, Object... keyValues)
VertexVertexProperty.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 cardinality
 graph().features().vertex().getCardinality(key). The provided key/values are the properties of the
 newly created VertexProperty. These key/values must be provided in an even number where the odd
 numbered arguments are String.property in interface VertexV - the type of the value of the vertex propertykey - the key of the vertex propertyvalue - The value of the vertex propertykeyValues - the key/value pairs to turn into vertex property propertiespublic <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 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 Object id()
ElementElement.public String label()
ElementElement which helps categorize it.public Graph graph()
Elementpublic void remove()
ElementElement from the graph.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 Vertexpublic Vertex getBaseVertex()
getBaseVertex in interface WrappedVertex<Vertex>Copyright © 2013–2019 Apache Software Foundation. All rights reserved.