Class

com.datastax.bdp.graph.spark.graphframe

DseGraphTraversal

Related Doc: package graphframe

Permalink

class DseGraphTraversal[E] extends DefaultGraphTraversal[Row, E]

wrap vertex data frame to implement TinkerPop functions

Linear Supertypes
DefaultGraphTraversal[Row, E], Admin[Row, E], GraphTraversal[Row, E], DefaultTraversal[Row, E], Admin[Row, E], Traversal[Row, E], AutoCloseable, Cloneable, Serializable, Iterator[E], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. DseGraphTraversal
  2. DefaultGraphTraversal
  3. Admin
  4. GraphTraversal
  5. DefaultTraversal
  6. Admin
  7. Traversal
  8. AutoCloseable
  9. Cloneable
  10. Serializable
  11. Iterator
  12. AnyRef
  13. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new DseGraphTraversal(dgf: DseGraphFrame)(implicit arg0: scala.reflect.api.JavaUniverse.TypeTag[E])

    Permalink

Value Members

  1. final def !=(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  4. val TraversersColumn: Column

    Permalink
    Attributes
    protected
  5. val TraversersColumnName: String

    Permalink
    Attributes
    protected
  6. def V(arg0: <repeated...>[AnyRef]): GraphTraversal[Row, Vertex]

    Permalink
    Definition Classes
    GraphTraversal
  7. def addE(arg0: Traversal[_, String]): GraphTraversal[Row, Edge]

    Permalink
    Definition Classes
    GraphTraversal
  8. def addE(arg0: String): GraphTraversal[Row, Edge]

    Permalink
    Definition Classes
    GraphTraversal
  9. def addStart(arg0: Admin[Row]): Unit

    Permalink
    Definition Classes
    DefaultTraversal → Admin
  10. def addStarts(arg0: Iterator[Admin[Row]]): Unit

    Permalink
    Definition Classes
    DefaultTraversal → Admin
  11. def addStep[E2](arg0: Step[_, E2]): Admin[Row, E2]

    Permalink
    Definition Classes
    Admin → Admin
  12. def addStep[S2, E2](arg0: Int, arg1: Step[_, _]): Admin[S2, E2]

    Permalink
    Definition Classes
    DefaultTraversal → Admin
    Annotations
    @throws( ... )
  13. def addTraverserColumn(label: String, df: DataFrame): DataFrame

    Permalink

    as(), where() and some other steps need a place to store a state of the treverser.

    as(), where() and some other steps need a place to store a state of the treverser. So we add "~traversers" cstruct column to hold reference to it. This method is used by as() step to register nemed traverser

    label

    name provided to as(label) call

    df

    Dataframe with current state

    returns

    Dataframe with label column added to the ~traversers that point ot the current df.

  14. def addV(): GraphTraversal[Row, Vertex]

    Permalink
    Definition Classes
    GraphTraversal
  15. def addV(arg0: Traversal[_, String]): GraphTraversal[Row, Vertex]

    Permalink
    Definition Classes
    GraphTraversal
  16. def addV(arg0: String): GraphTraversal[Row, Vertex]

    Permalink
    Definition Classes
    GraphTraversal
  17. def aggregate(arg0: String): GraphTraversal[Row, E]

    Permalink
    Definition Classes
    GraphTraversal
  18. def and(arg0: <repeated...>[Traversal[_, _]]): GraphTraversal[Row, E]

    Permalink
    Definition Classes
    GraphTraversal
  19. def applyStrategies(): Unit

    Permalink
    Definition Classes
    DefaultTraversal → Admin
    Annotations
    @throws( ... )
  20. def as(arg0: String, arg1: <repeated...>[String]): GraphTraversal[Row, E]

    Permalink
    Definition Classes
    GraphTraversal
  21. def asAdmin(): Admin[Row, E]

    Permalink
    Definition Classes
    DefaultGraphTraversal → GraphTraversal → DefaultTraversal → Traversal
  22. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  23. def barrier(arg0: Consumer[TraverserSet[AnyRef]]): GraphTraversal[Row, E]

    Permalink
    Definition Classes
    GraphTraversal
  24. def barrier(arg0: Int): GraphTraversal[Row, E]

    Permalink
    Definition Classes
    GraphTraversal
  25. def barrier(): GraphTraversal[Row, E]

    Permalink
    Definition Classes
    GraphTraversal
  26. def both(arg0: <repeated...>[String]): GraphTraversal[Row, Vertex]

    Permalink
    Definition Classes
    GraphTraversal
  27. def bothE(arg0: <repeated...>[String]): GraphTraversal[Row, Edge]

    Permalink
    Definition Classes
    GraphTraversal
  28. def bothV(): GraphTraversal[Row, Vertex]

    Permalink
    Definition Classes
    GraphTraversal
  29. def branch[M, E2](arg0: Function[Traverser[E], M]): GraphTraversal[Row, E2]

    Permalink
    Definition Classes
    GraphTraversal
  30. def branch[M, E2](arg0: Traversal[_, M]): GraphTraversal[Row, E2]

    Permalink
    Definition Classes
    GraphTraversal
  31. def by[U](arg0: Function[U, AnyRef], arg1: Comparator): GraphTraversal[Row, E]

    Permalink
    Definition Classes
    GraphTraversal
  32. def by[V](arg0: String, arg1: Comparator[V]): GraphTraversal[Row, E]

    Permalink
    Definition Classes
    GraphTraversal
  33. def by(arg0: org.apache.tinkerpop.gremlin.process.traversal.Order): GraphTraversal[Row, E]

    Permalink
    Definition Classes
    GraphTraversal
  34. def by(arg0: Comparator[E]): GraphTraversal[Row, E]

    Permalink
    Definition Classes
    GraphTraversal
  35. def by[V](arg0: Traversal[_, _], arg1: Comparator[V]): GraphTraversal[Row, E]

    Permalink
    Definition Classes
    GraphTraversal
  36. def by[V](arg0: Function[V, AnyRef]): GraphTraversal[Row, E]

    Permalink
    Definition Classes
    GraphTraversal
  37. def by(arg0: String): GraphTraversal[Row, E]

    Permalink
    Definition Classes
    GraphTraversal
  38. def by(arg0: T): GraphTraversal[Row, E]

    Permalink
    Definition Classes
    GraphTraversal
  39. def by(arg0: Traversal[_, _]): GraphTraversal[Row, E]

    Permalink
    Definition Classes
    GraphTraversal
  40. def by(): GraphTraversal[Row, E]

    Permalink
    Definition Classes
    GraphTraversal
  41. def cap[E2](arg0: String, arg1: <repeated...>[String]): GraphTraversal[Row, E2]

    Permalink
    Definition Classes
    GraphTraversal
  42. def choose[E2](arg0: Predicate[E], arg1: Traversal[_, E2]): GraphTraversal[Row, E2]

    Permalink
    Definition Classes
    GraphTraversal
  43. def choose[E2](arg0: Predicate[E], arg1: Traversal[_, E2], arg2: Traversal[_, E2]): GraphTraversal[Row, E2]

    Permalink
    Definition Classes
    GraphTraversal
  44. def choose[M, E2](arg0: Function[E, M]): GraphTraversal[Row, E2]

    Permalink
    Definition Classes
    GraphTraversal
  45. def choose[E2](arg0: Traversal[_, _], arg1: Traversal[_, E2]): GraphTraversal[Row, E2]

    Permalink
    Definition Classes
    GraphTraversal
  46. def choose[E2](arg0: Traversal[_, _], arg1: Traversal[_, E2], arg2: Traversal[_, E2]): GraphTraversal[Row, E2]

    Permalink
    Definition Classes
    GraphTraversal
  47. def choose[M, E2](arg0: Traversal[_, M]): GraphTraversal[Row, E2]

    Permalink
    Definition Classes
    GraphTraversal
  48. def clone(): DefaultGraphTraversal[Row, E]

    Permalink
    Definition Classes
    DefaultGraphTraversal → Admin → DefaultTraversal → Admin → AnyRef
  49. def close(): Unit

    Permalink
    Definition Classes
    Traversal → AutoCloseable
    Annotations
    @throws( classOf[java.lang.Exception] )
  50. def coalesce[E2](arg0: <repeated...>[Traversal[_, E2]]): GraphTraversal[Row, E2]

    Permalink
    Definition Classes
    GraphTraversal
  51. def coin(arg0: Double): GraphTraversal[Row, E]

    Permalink
    Definition Classes
    GraphTraversal
  52. def constant[E2](arg0: E2): GraphTraversal[Row, E2]

    Permalink
    Definition Classes
    GraphTraversal
  53. def copySteps[T](traversal: Admin[_, _]): DseGraphTraversal[T]

    Permalink

    add steps from another traversal, the first graph step is skipped.

  54. def count(arg0: Scope): GraphTraversal[Row, Long]

    Permalink
    Definition Classes
    GraphTraversal
  55. def count(): GraphTraversal[Row, Long]

    Permalink
    Definition Classes
    GraphTraversal
  56. def customPredicateUdf(p: P[_], column: Column, columnName: String): Column

    Permalink
  57. def cyclicPath(): GraphTraversal[Row, E]

    Permalink
    Definition Classes
    GraphTraversal
  58. def dedup(arg0: <repeated...>[String]): GraphTraversal[Row, E]

    Permalink
    Definition Classes
    GraphTraversal
  59. def dedup(arg0: Scope, arg1: <repeated...>[String]): GraphTraversal[Row, E]

    Permalink
    Definition Classes
    GraphTraversal
  60. def df: DataFrame

    Permalink

    the main processing method.

    the main processing method. It calls interceptors then does default processing

    returns

    traversal result as a DataFrame

  61. val dgf: DseGraphFrame

    Permalink
  62. def drop(): GraphTraversal[Row, E]

    Permalink
    Definition Classes
    GraphTraversal
  63. def edgeToVertexWithDirection(v: DataFrame, e: DataFrame, in: Boolean, idOnly: Boolean): DataFrame

    Permalink
    Attributes
    protected
  64. def emit(): GraphTraversal[Row, E]

    Permalink
    Definition Classes
    GraphTraversal
  65. def emit(arg0: Predicate[Traverser[E]]): GraphTraversal[Row, E]

    Permalink
    Definition Classes
    GraphTraversal
  66. def emit(arg0: Traversal[_, _]): GraphTraversal[Row, E]

    Permalink
    Definition Classes
    GraphTraversal
  67. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  68. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    DefaultTraversal → AnyRef → Any
  69. def equals(arg0: Admin[Row, E]): Boolean

    Permalink
    Definition Classes
    Admin
  70. def explain(): TraversalExplanation

    Permalink
    Definition Classes
    Traversal
  71. def extractColumnsFromElementTraversal(traversal: Traversal[_, _], result: DataFrame): Seq[String]

    Permalink
    Attributes
    protected
  72. def fill[C <: Collection[E]](arg0: C): C

    Permalink
    Definition Classes
    Traversal
  73. def filter(arg0: Traversal[_, _]): GraphTraversal[Row, E]

    Permalink
    Definition Classes
    GraphTraversal
  74. def filter(arg0: Predicate[Traverser[E]]): GraphTraversal[Row, E]

    Permalink
    Definition Classes
    GraphTraversal
  75. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  76. def findResultStep(step: Step[_, _]): Step[_, _]

    Permalink

    val find result step by skipping sorting and dedup

    val find result step by skipping sorting and dedup

    Attributes
    protected
  77. def flatMap[E2](arg0: Traversal[_, E2]): GraphTraversal[Row, E2]

    Permalink
    Definition Classes
    GraphTraversal
  78. def flatMap[E2](arg0: Function[Traverser[E], Iterator[E2]]): GraphTraversal[Row, E2]

    Permalink
    Definition Classes
    GraphTraversal
  79. def fold[E2](arg0: E2, arg1: BiFunction[E2, E, E2]): GraphTraversal[Row, E2]

    Permalink
    Definition Classes
    GraphTraversal
  80. def fold(): GraphTraversal[Row, List[E]]

    Permalink
    Definition Classes
    GraphTraversal
  81. def forEachRemaining(arg0: Consumer[_ >: E]): Unit

    Permalink
    Definition Classes
    Traversal → Iterator
  82. def forEachRemaining[E2](arg0: Class[E2], arg1: Consumer[E2]): Unit

    Permalink
    Definition Classes
    Traversal
  83. def from(arg0: Vertex): GraphTraversal[Row, E]

    Permalink
    Definition Classes
    GraphTraversal
  84. def from(arg0: Traversal[_, Vertex]): GraphTraversal[Row, E]

    Permalink
    Definition Classes
    GraphTraversal
  85. def from(arg0: String): GraphTraversal[Row, E]

    Permalink
    Definition Classes
    GraphTraversal
  86. def getBytecode(): Bytecode

    Permalink
    Definition Classes
    DefaultTraversal → Admin
  87. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  88. def getEndStep(): Step[_, E]

    Permalink
    Definition Classes
    DefaultTraversal → Admin
  89. def getGraph(): Optional[Graph]

    Permalink
    Definition Classes
    DefaultTraversal → Admin
  90. def getParent(): TraversalParent

    Permalink
    Definition Classes
    DefaultTraversal → Admin
  91. def getPrivateField[T](o: Any, fieldName: String): T

    Permalink

    Use this method to get Step properties to work around interface inconsistency.

    Use this method to get Step properties to work around interface inconsistency.

    Attributes
    protected
  92. def getSideEffects(): TraversalSideEffects

    Permalink
    Definition Classes
    DefaultTraversal → Admin
  93. def getStartStep(): Step[Row, _]

    Permalink
    Definition Classes
    DefaultTraversal → Admin
  94. def getSteps(): List[Step[_, _]]

    Permalink
    Definition Classes
    DefaultTraversal → Admin
  95. def getStrategies(): TraversalStrategies

    Permalink
    Definition Classes
    DefaultTraversal → Admin
  96. def getTraverserGenerator(): TraverserGenerator

    Permalink
    Definition Classes
    DefaultTraversal → Admin
  97. def getTraverserRequirements(): Set[TraverserRequirement]

    Permalink
    Definition Classes
    DefaultTraversal → Admin
  98. def graphName: String

    Permalink
  99. def graphName(name: String): DseGraphTraversal[E]

    Permalink

    Set name of the graph in case it was lost during conversion operations or the result should be stored in another graph The name will be updated in the DseGraphFrame

    Set name of the graph in case it was lost during conversion operations or the result should be stored in another graph The name will be updated in the DseGraphFrame

    name

    of the graph

    returns

    this

  100. def group(arg0: String): GraphTraversal[Row, E]

    Permalink
    Definition Classes
    GraphTraversal
  101. def group[K, V](): GraphTraversal[Row, Map[K, V]]

    Permalink
    Definition Classes
    GraphTraversal
  102. def groupCount(arg0: String): GraphTraversal[Row, E]

    Permalink
    Definition Classes
    GraphTraversal
  103. def groupCount[K](): GraphTraversal[Row, Map[K, Long]]

    Permalink
    Definition Classes
    GraphTraversal
  104. def groupCountIterator: Iterator[E]

    Permalink
  105. def has(arg0: String): GraphTraversal[Row, E]

    Permalink
    Definition Classes
    GraphTraversal
  106. def has(arg0: String, arg1: Traversal[_, _]): GraphTraversal[Row, E]

    Permalink
    Definition Classes
    GraphTraversal
  107. def has(arg0: T, arg1: Traversal[_, _]): GraphTraversal[Row, E]

    Permalink
    Definition Classes
    GraphTraversal
  108. def has(arg0: String, arg1: String, arg2: Any): GraphTraversal[Row, E]

    Permalink
    Definition Classes
    GraphTraversal
  109. def has(arg0: String, arg1: String, arg2: P[_]): GraphTraversal[Row, E]

    Permalink
    Definition Classes
    GraphTraversal
  110. def has(arg0: T, arg1: Any): GraphTraversal[Row, E]

    Permalink
    Definition Classes
    GraphTraversal
  111. def has(arg0: String, arg1: Any): GraphTraversal[Row, E]

    Permalink
    Definition Classes
    GraphTraversal
  112. def has(arg0: T, arg1: P[_]): GraphTraversal[Row, E]

    Permalink
    Definition Classes
    GraphTraversal
  113. def has(arg0: String, arg1: P[_]): GraphTraversal[Row, E]

    Permalink
    Definition Classes
    GraphTraversal
  114. def hasId(arg0: P[AnyRef]): GraphTraversal[Row, E]

    Permalink
    Definition Classes
    GraphTraversal
  115. def hasId(arg0: Any, arg1: <repeated...>[AnyRef]): GraphTraversal[Row, E]

    Permalink
    Definition Classes
    GraphTraversal
  116. def hasKey(arg0: P[String]): GraphTraversal[Row, E]

    Permalink
    Definition Classes
    GraphTraversal
  117. def hasKey(arg0: String, arg1: <repeated...>[String]): GraphTraversal[Row, E]

    Permalink
    Definition Classes
    GraphTraversal
  118. def hasLabel(arg0: P[String]): GraphTraversal[Row, E]

    Permalink
    Definition Classes
    GraphTraversal
  119. def hasLabel(arg0: String, arg1: <repeated...>[String]): GraphTraversal[Row, E]

    Permalink
    Definition Classes
    GraphTraversal
  120. def hasNext(): Boolean

    Permalink

    Iterator methods cause DataFrame collect() call, that materializes all rows on the driver call at the end of computations.

    Iterator methods cause DataFrame collect() call, that materializes all rows on the driver call at the end of computations.

    Definition Classes
    DseGraphTraversal → DefaultTraversal → Iterator
  121. def hasNot(arg0: String): GraphTraversal[Row, E]

    Permalink
    Definition Classes
    GraphTraversal
  122. def hasValue(arg0: P[AnyRef]): GraphTraversal[Row, E]

    Permalink
    Definition Classes
    GraphTraversal
  123. def hasValue(arg0: Any, arg1: <repeated...>[AnyRef]): GraphTraversal[Row, E]

    Permalink
    Definition Classes
    GraphTraversal
  124. def hashCode(): Int

    Permalink
    Definition Classes
    DefaultTraversal → AnyRef → Any
  125. def id(): GraphTraversal[Row, AnyRef]

    Permalink
    Definition Classes
    GraphTraversal
  126. def idColumnNames: Seq[String]

    Permalink
    Attributes
    protected
  127. def idColumns: Seq[Column]

    Permalink
    Attributes
    protected
  128. def idGroupCountIterator: Iterator[E]

    Permalink
  129. def idIterator: Iterator[E]

    Permalink
  130. def idOnlyVertexStep(step: Step[_, _]): Boolean

    Permalink

    Check the step is required only id column The method is used in traversal steps to reduce number of join operations

    Check the step is required only id column The method is used in traversal steps to reduce number of join operations

    step

    to check

    returns

    true for steps that need only vertex id

    Attributes
    protected
  131. def identity(): GraphTraversal[Row, E]

    Permalink
    Definition Classes
    GraphTraversal
  132. def identityGroupCountIterator: Iterator[E]

    Permalink
  133. def in(arg0: <repeated...>[String]): GraphTraversal[Row, Vertex]

    Permalink
    Definition Classes
    GraphTraversal
  134. def inE(arg0: <repeated...>[String]): GraphTraversal[Row, Edge]

    Permalink
    Definition Classes
    GraphTraversal
  135. def inV(): GraphTraversal[Row, Vertex]

    Permalink
    Definition Classes
    GraphTraversal
  136. def infixToPrefix(steps: Seq[Step[_, _]]): Seq[Step[_, _]]

    Permalink

    Find OrStep and AndStep in infix notation and rearrange them to prefix one so leftSteps().and().rightSteps() => and(leftSteps(), rightSteps())

    Find OrStep and AndStep in infix notation and rearrange them to prefix one so leftSteps().and().rightSteps() => and(leftSteps(), rightSteps())

    returns

    rearranged steps

    Attributes
    protected
  137. def inject(arg0: <repeated...>[E]): GraphTraversal[Row, E]

    Permalink
    Definition Classes
    GraphTraversal
  138. def is(arg0: Any): GraphTraversal[Row, E]

    Permalink
    Definition Classes
    GraphTraversal
  139. def is(arg0: P[E]): GraphTraversal[Row, E]

    Permalink
    Definition Classes
    GraphTraversal
  140. def isEdgeTraversal: Boolean

    Permalink
  141. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  142. def isLastStep(step: Step[_, _]): Boolean

    Permalink
    Attributes
    protected
  143. def isLocked(): Boolean

    Permalink
    Definition Classes
    DefaultTraversal → Admin
  144. def isStdPredicate(p: BiPredicate[_, _]): Boolean

    Permalink
  145. def isVertexTraversal: Boolean

    Permalink
  146. def iterate(): GraphTraversal[Row, E]

    Permalink
    Definition Classes
    DseGraphTraversal → DefaultGraphTraversal → Admin → GraphTraversal
  147. def iterate[A, B](): Traversal[A, B]

    Permalink
    Definition Classes
    Traversal
  148. lazy val iterator: Iterator[E]

    Permalink

    Iterator methods cause DataFrame collect() call, that materializes all rows on the driver only count().next() is supported for now It is recommended to get table like results with df() method.

    Iterator methods cause DataFrame collect() call, that materializes all rows on the driver only count().next() is supported for now It is recommended to get table like results with df() method.

    Attributes
    protected
  149. def key(): GraphTraversal[Row, String]

    Permalink
    Definition Classes
    GraphTraversal
  150. def label(): GraphTraversal[Row, String]

    Permalink
    Definition Classes
    GraphTraversal
  151. def limit[E2](arg0: Scope, arg1: Long): GraphTraversal[Row, E2]

    Permalink
    Definition Classes
    GraphTraversal
  152. def limit(arg0: Long): GraphTraversal[Row, E]

    Permalink
    Definition Classes
    GraphTraversal
  153. def local[E2](arg0: Traversal[_, E2]): GraphTraversal[Row, E2]

    Permalink
    Definition Classes
    GraphTraversal
  154. def loops(): GraphTraversal[Row, Integer]

    Permalink
    Definition Classes
    GraphTraversal
  155. def map[E2](arg0: Traversal[_, E2]): GraphTraversal[Row, E2]

    Permalink
    Definition Classes
    GraphTraversal
  156. def map[E2](arg0: Function[Traverser[E], E2]): GraphTraversal[Row, E2]

    Permalink
    Definition Classes
    GraphTraversal
  157. def match[E2](arg0: <repeated...>[Traversal[_, _]]): GraphTraversal[Row, Map[String, E2]]

    Permalink
    Definition Classes
    GraphTraversal
  158. def math(arg0: String): GraphTraversal[Row, Double]

    Permalink
    Definition Classes
    GraphTraversal
  159. def max[E2 <: Number](arg0: Scope): GraphTraversal[Row, E2]

    Permalink
    Definition Classes
    GraphTraversal
  160. def max[E2 <: Number](): GraphTraversal[Row, E2]

    Permalink
    Definition Classes
    GraphTraversal
  161. def mayIgnoreLocal(steps: List[Step[_, _]]): Boolean

    Permalink
  162. def mayIgnoreLocal(step: Step[_, _]): Boolean

    Permalink

    check that steps inside LocalStep are safe to ignore local step, (has no order, dedupe, limit, etc steps) It uses white list of supported safe stpes.

    check that steps inside LocalStep are safe to ignore local step, (has no order, dedupe, limit, etc steps) It uses white list of supported safe stpes.

    step

    to check

  163. def mean[E2 <: Number](arg0: Scope): GraphTraversal[Row, E2]

    Permalink
    Definition Classes
    GraphTraversal
  164. def mean[E2 <: Number](): GraphTraversal[Row, E2]

    Permalink
    Definition Classes
    GraphTraversal
  165. def min[E2 <: Number](arg0: Scope): GraphTraversal[Row, E2]

    Permalink
    Definition Classes
    GraphTraversal
  166. def min[E2 <: Number](): GraphTraversal[Row, E2]

    Permalink
    Definition Classes
    GraphTraversal
  167. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  168. def next(): E

    Permalink

    Iterator methods cause DataFrame collect() call, that materializes all rows on the driver call at the end of computations.

    Iterator methods cause DataFrame collect() call, that materializes all rows on the driver call at the end of computations.

    Definition Classes
    DseGraphTraversal → DefaultTraversal → Iterator
  169. def next(arg0: Int): List[E]

    Permalink
    Definition Classes
    Traversal
  170. def nextTraverser(): Admin[E]

    Permalink
    Definition Classes
    DefaultTraversal → Admin
  171. def none(): Traversal[Row, E]

    Permalink
    Definition Classes
    Traversal
  172. def not(arg0: Traversal[_, _]): GraphTraversal[Row, E]

    Permalink
    Definition Classes
    GraphTraversal
  173. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  174. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  175. def option[E2](arg0: Traversal[_, E2]): GraphTraversal[Row, E]

    Permalink
    Definition Classes
    GraphTraversal
  176. def option[M, E2](arg0: M, arg1: Traversal[_, E2]): GraphTraversal[Row, E]

    Permalink
    Definition Classes
    GraphTraversal
  177. def optional[E2](arg0: Traversal[_, E2]): GraphTraversal[Row, E2]

    Permalink
    Definition Classes
    GraphTraversal
  178. def or(arg0: <repeated...>[Traversal[_, _]]): GraphTraversal[Row, E]

    Permalink
    Definition Classes
    GraphTraversal
  179. def order(arg0: Scope): GraphTraversal[Row, E]

    Permalink
    Definition Classes
    GraphTraversal
  180. def order(): GraphTraversal[Row, E]

    Permalink
    Definition Classes
    GraphTraversal
  181. def otherV(): GraphTraversal[Row, Vertex]

    Permalink
    Definition Classes
    GraphTraversal
  182. def out(arg0: <repeated...>[String]): GraphTraversal[Row, Vertex]

    Permalink
    Definition Classes
    GraphTraversal
  183. def outE(arg0: <repeated...>[String]): GraphTraversal[Row, Edge]

    Permalink
    Definition Classes
    GraphTraversal
  184. def outV(): GraphTraversal[Row, Vertex]

    Permalink
    Definition Classes
    GraphTraversal
  185. def pageRank(arg0: Double): GraphTraversal[Row, E]

    Permalink
    Definition Classes
    GraphTraversal
  186. def pageRank(): GraphTraversal[Row, E]

    Permalink
    Definition Classes
    GraphTraversal
  187. def path(): GraphTraversal[Row, Path]

    Permalink
    Definition Classes
    GraphTraversal
  188. def peerPressure(): GraphTraversal[Row, E]

    Permalink
    Definition Classes
    GraphTraversal
  189. def process(step: RangeGlobalStep[_], df: DataFrame): DataFrame

    Permalink
    Attributes
    protected
  190. def process(step: OrderGlobalStep[_, _], df: DataFrame): DataFrame

    Permalink
    Attributes
    protected
  191. def process(step: LocalStep[_, _], df: DataFrame): DataFrame

    Permalink
  192. def process(step: SelectOneStep[_, _], df: DataFrame): DataFrame

    Permalink
  193. def process(step: SelectStep[_, _], df: DataFrame): DataFrame

    Permalink
  194. def process(step: StartStep[_], df: DataFrame): DataFrame

    Permalink
  195. def process(step: GroupCountStep[_, _], df: DataFrame): DataFrame

    Permalink
    Attributes
    protected
  196. def process(step: OrStep[_], df: DataFrame): DataFrame

    Permalink
    Attributes
    protected
  197. def process(step: AndStep[_], df: DataFrame): DataFrame

    Permalink
    Attributes
    protected
  198. def process(step: NotStep[_], result: DataFrame): DataFrame

    Permalink
    Attributes
    protected
  199. def process(step: TraversalFilterStep[_], result: DataFrame): DataFrame

    Permalink
    Attributes
    protected
  200. def process(step: VertexStep[_], df: DataFrame): DataFrame

    Permalink

    there are two combination of vertex steps Vertex->Vertex | g.V().out() Vertex->Egde | g.V().outE() with three direcctions: IN, OUT, BOTH

    there are two combination of vertex steps Vertex->Vertex | g.V().out() Vertex->Egde | g.V().outE() with three direcctions: IN, OUT, BOTH

    Attributes
    protected
  201. def process(step: EdgeVertexStep, df: DataFrame): DataFrame

    Permalink

    there are three combination of edge steps g.E().outV() g.E().inV() g.E().bothV() with three directions: IN, OUT, BOTH

    there are three combination of edge steps g.E().outV() g.E().inV() g.E().bothV() with three directions: IN, OUT, BOTH

    Attributes
    protected
  202. def process(step: DedupGlobalStep[_], df: DataFrame): DataFrame

    Permalink
    Attributes
    protected
  203. def process(step: WherePredicateStep[_], df: DataFrame): DataFrame

    Permalink
    Attributes
    protected
  204. def process(step: HasStep[_], df: DataFrame): DataFrame

    Permalink
    Attributes
    protected
  205. def process(step: IsStep[_], df: DataFrame): DataFrame

    Permalink
    Attributes
    protected
  206. def process(step: PageRankVertexProgramStep, df: DataFrame): DataFrame

    Permalink
    Attributes
    protected
  207. def process(step: AddPropertyStep[_], df: DataFrame): DataFrame

    Permalink
  208. def process(step: DropStep[_], df: DataFrame): DataFrame

    Permalink
  209. def process(step: PropertiesStep[_], df: DataFrame): DataFrame

    Permalink
  210. def process(step: PropertyMapStep[_, _], df: DataFrame): DataFrame

    Permalink
  211. def process(step: LabelStep[_], df: DataFrame): DataFrame

    Permalink
  212. def process(step: IdStep[_], df: DataFrame): DataFrame

    Permalink
  213. def process(step: CountGlobalStep[_], df: DataFrame): DataFrame

    Permalink
    Attributes
    protected
  214. def process(steps: List[Step[_, _]], df: DataFrame): DataFrame

    Permalink
    Attributes
    protected
  215. def process(df: DataFrame): DataFrame

    Permalink
    Attributes
    protected
  216. def processLabels(step: Step[_, _], df: DataFrame): DataFrame

    Permalink
    Attributes
    protected
  217. def profile(): GraphTraversal[Row, TraversalMetrics]

    Permalink
    Definition Classes
    GraphTraversal → Traversal
  218. def profile(arg0: String): GraphTraversal[Row, E]

    Permalink
    Definition Classes
    GraphTraversal
  219. def program(arg0: VertexProgram[_]): GraphTraversal[Row, E]

    Permalink
    Definition Classes
    GraphTraversal
  220. def project[E2](arg0: String, arg1: <repeated...>[String]): GraphTraversal[Row, Map[String, E2]]

    Permalink
    Definition Classes
    GraphTraversal
  221. def promise[T](arg0: Function[Traversal[Row, E], T]): CompletableFuture[T]

    Permalink
    Definition Classes
    Traversal
  222. def properties[E2](arg0: <repeated...>[String]): GraphTraversal[Row, _ <: Property[E2]]

    Permalink
    Definition Classes
    GraphTraversal
  223. def propertiesIterator: Iterator[E]

    Permalink
  224. def property(arg0: Any, arg1: Any, arg2: <repeated...>[AnyRef]): GraphTraversal[Row, E]

    Permalink
    Definition Classes
    GraphTraversal
  225. def property(arg0: Cardinality, arg1: Any, arg2: Any, arg3: <repeated...>[AnyRef]): GraphTraversal[Row, E]

    Permalink
    Definition Classes
    GraphTraversal
  226. def propertyMap[E2](arg0: <repeated...>[String]): GraphTraversal[Row, Map[String, E2]]

    Permalink
    Definition Classes
    GraphTraversal
  227. def propertyMapIterator(includeId: Boolean, selectProperties: Boolean = false): Iterator[E]

    Permalink
  228. def range[E2](arg0: Scope, arg1: Long, arg2: Long): GraphTraversal[Row, E2]

    Permalink
    Definition Classes
    GraphTraversal
  229. def range(arg0: Long, arg1: Long): GraphTraversal[Row, E]

    Permalink
    Definition Classes
    GraphTraversal
  230. def remove(): Unit

    Permalink
    Definition Classes
    Iterator
  231. def removeStep[S2, E2](arg0: Int): Admin[S2, E2]

    Permalink
    Definition Classes
    DefaultTraversal → Admin
    Annotations
    @throws( ... )
  232. def removeStep[S2, E2](arg0: Step[_, _]): Admin[S2, E2]

    Permalink
    Definition Classes
    Admin
    Annotations
    @throws( ... )
  233. def repeat(arg0: Traversal[_, E]): GraphTraversal[Row, E]

    Permalink
    Definition Classes
    GraphTraversal
  234. def reset(): Unit

    Permalink
    Definition Classes
    DefaultTraversal → Admin
  235. def sack[V, U](arg0: BiFunction[V, U, V]): GraphTraversal[Row, E]

    Permalink
    Definition Classes
    GraphTraversal
  236. def sack[E2](): GraphTraversal[Row, E2]

    Permalink
    Definition Classes
    GraphTraversal
  237. def sample(arg0: Scope, arg1: Int): GraphTraversal[Row, E]

    Permalink
    Definition Classes
    GraphTraversal
  238. def sample(arg0: Int): GraphTraversal[Row, E]

    Permalink
    Definition Classes
    GraphTraversal
  239. def select[E2](arg0: Column): GraphTraversal[Row, Collection[E2]]

    Permalink
    Definition Classes
    GraphTraversal
  240. def select[E2](arg0: Traversal[Row, E2]): GraphTraversal[Row, E2]

    Permalink
    Definition Classes
    GraphTraversal
  241. def select[E2](arg0: Pop, arg1: Traversal[Row, E2]): GraphTraversal[Row, E2]

    Permalink
    Definition Classes
    GraphTraversal
  242. def select[E2](arg0: String): GraphTraversal[Row, E2]

    Permalink
    Definition Classes
    GraphTraversal
  243. def select[E2](arg0: Pop, arg1: String): GraphTraversal[Row, E2]

    Permalink
    Definition Classes
    GraphTraversal
  244. def select[E2](arg0: String, arg1: String, arg2: <repeated...>[String]): GraphTraversal[Row, Map[String, E2]]

    Permalink
    Definition Classes
    GraphTraversal
  245. def select[E2](arg0: Pop, arg1: String, arg2: String, arg3: <repeated...>[String]): GraphTraversal[Row, Map[String, E2]]

    Permalink
    Definition Classes
    GraphTraversal
  246. def setEdgeTraversal: Unit

    Permalink
  247. def setGraph(arg0: Graph): Unit

    Permalink
    Definition Classes
    DefaultTraversal → Admin
  248. def setParent(arg0: TraversalParent): Unit

    Permalink
    Definition Classes
    DefaultTraversal → Admin
  249. def setSideEffects(arg0: TraversalSideEffects): Unit

    Permalink
    Definition Classes
    DefaultTraversal → Admin
  250. def setStrategies(arg0: TraversalStrategies): Unit

    Permalink
    Definition Classes
    DefaultTraversal → Admin
  251. def setVertexTraversal: Unit

    Permalink
  252. def sideEffect(arg0: Traversal[_, _]): GraphTraversal[Row, E]

    Permalink
    Definition Classes
    GraphTraversal
  253. def sideEffect(arg0: Consumer[Traverser[E]]): GraphTraversal[Row, E]

    Permalink
    Definition Classes
    GraphTraversal
  254. def simplePath(): GraphTraversal[Row, E]

    Permalink
    Definition Classes
    GraphTraversal
  255. def skip[E2](arg0: Scope, arg1: Long): GraphTraversal[Row, E2]

    Permalink
    Definition Classes
    GraphTraversal
  256. def skip(arg0: Long): GraphTraversal[Row, E]

    Permalink
    Definition Classes
    GraphTraversal
  257. def standardIdColumnNamesToRemove: Seq[String]

    Permalink

    if standard id is used and user do not use it as regular properties in some vertices.

    if standard id is used and user do not use it as regular properties in some vertices. valueMap and values() should not show them.

    returns

    "community_id", "member_id" or both if they are not used as regular properties

    Attributes
    protected
  258. def stdPredicateUdf(p: P[_], column: Column): Column

    Permalink
  259. def store(arg0: String): GraphTraversal[Row, E]

    Permalink
    Definition Classes
    GraphTraversal
  260. def subgraph(arg0: String): GraphTraversal[Row, Edge]

    Permalink
    Definition Classes
    GraphTraversal
  261. def sum[E2 <: Number](arg0: Scope): GraphTraversal[Row, E2]

    Permalink
    Definition Classes
    GraphTraversal
  262. def sum[E2 <: Number](): GraphTraversal[Row, E2]

    Permalink
    Definition Classes
    GraphTraversal
  263. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  264. def systemColumnNames: Seq[String]

    Permalink
    Attributes
    protected
  265. def systemColumns: Seq[Column]

    Permalink
    Attributes
    protected
  266. def tail[E2](arg0: Scope, arg1: Long): GraphTraversal[Row, E2]

    Permalink
    Definition Classes
    GraphTraversal
  267. def tail[E2](arg0: Scope): GraphTraversal[Row, E2]

    Permalink
    Definition Classes
    GraphTraversal
  268. def tail(arg0: Long): GraphTraversal[Row, E]

    Permalink
    Definition Classes
    GraphTraversal
  269. def tail(): GraphTraversal[Row, E]

    Permalink
    Definition Classes
    GraphTraversal
  270. def timeLimit(arg0: Long): GraphTraversal[Row, E]

    Permalink
    Definition Classes
    GraphTraversal
  271. def times(arg0: Int): GraphTraversal[Row, E]

    Permalink
    Definition Classes
    GraphTraversal
  272. def to(arg0: Vertex): GraphTraversal[Row, E]

    Permalink
    Definition Classes
    GraphTraversal
  273. def to(arg0: Traversal[_, Vertex]): GraphTraversal[Row, E]

    Permalink
    Definition Classes
    GraphTraversal
  274. def to(arg0: String): GraphTraversal[Row, E]

    Permalink
    Definition Classes
    GraphTraversal
  275. def to(arg0: Direction, arg1: <repeated...>[String]): GraphTraversal[Row, Vertex]

    Permalink
    Definition Classes
    GraphTraversal
  276. def toBulkSet(): BulkSet[E]

    Permalink
    Definition Classes
    Traversal
  277. def toE(arg0: Direction, arg1: <repeated...>[String]): GraphTraversal[Row, Edge]

    Permalink
    Definition Classes
    GraphTraversal
  278. def toList(): List[E]

    Permalink
    Definition Classes
    DseGraphTraversal → Traversal
  279. def toSet(): Set[E]

    Permalink
    Definition Classes
    DseGraphTraversal → Traversal
  280. def toStream(): Stream[E]

    Permalink
    Definition Classes
    Traversal
  281. def toString(): String

    Permalink
    Definition Classes
    DefaultTraversal → AnyRef → Any
  282. def toV(arg0: Direction): GraphTraversal[Row, Vertex]

    Permalink
    Definition Classes
    GraphTraversal
  283. var traversalType: scala.reflect.api.JavaUniverse.Type

    Permalink

    traversal is mutable when steps are applied the typeTag is used to control step to step safety and type of the last step result for the iterator.

  284. def tree(arg0: String): GraphTraversal[Row, E]

    Permalink
    Definition Classes
    GraphTraversal
  285. def tree(): GraphTraversal[Row, Tree]

    Permalink
    Definition Classes
    GraphTraversal
  286. def tryNext(): Optional[E]

    Permalink
    Definition Classes
    Traversal
  287. def unfold[E2](): GraphTraversal[Row, E2]

    Permalink
    Definition Classes
    GraphTraversal
  288. def union[E2](arg0: <repeated...>[Traversal[_, E2]]): GraphTraversal[Row, E2]

    Permalink
    Definition Classes
    GraphTraversal
  289. def until(arg0: Predicate[Traverser[E]]): GraphTraversal[Row, E]

    Permalink
    Definition Classes
    GraphTraversal
  290. def until(arg0: Traversal[_, _]): GraphTraversal[Row, E]

    Permalink
    Definition Classes
    GraphTraversal
  291. def value[E2](): GraphTraversal[Row, E2]

    Permalink
    Definition Classes
    GraphTraversal
  292. def valueMap[E2](arg0: Boolean, arg1: <repeated...>[String]): GraphTraversal[Row, Map[AnyRef, E2]]

    Permalink
    Definition Classes
    GraphTraversal
  293. def valueMap[E2](arg0: <repeated...>[String]): GraphTraversal[Row, Map[String, E2]]

    Permalink
    Definition Classes
    GraphTraversal
  294. def values[E2](arg0: <repeated...>[String]): GraphTraversal[Row, E2]

    Permalink
    Definition Classes
    GraphTraversal
  295. def vertexToEdgeWithDirection(v: DataFrame, e: DataFrame, in: Boolean, returnEdge: Boolean, idOnly: Boolean): DataFrame

    Permalink
    Attributes
    protected
  296. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  297. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  298. final def wait(arg0: Long): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  299. def where(arg0: Traversal[_, _]): GraphTraversal[Row, E]

    Permalink
    Definition Classes
    GraphTraversal
  300. def where(arg0: P[String]): GraphTraversal[Row, E]

    Permalink
    Definition Classes
    GraphTraversal
  301. def where(arg0: String, arg1: P[String]): GraphTraversal[Row, E]

    Permalink
    Definition Classes
    GraphTraversal

Inherited from DefaultGraphTraversal[Row, E]

Inherited from Admin[Row, E]

Inherited from GraphTraversal[Row, E]

Inherited from DefaultTraversal[Row, E]

Inherited from Admin[Row, E]

Inherited from Traversal[Row, E]

Inherited from AutoCloseable

Inherited from Cloneable

Inherited from Serializable

Inherited from Iterator[E]

Inherited from AnyRef

Inherited from Any

Ungrouped