NodeTraversal

overflowdb.traversal.NodeTraversal
final class NodeTraversal[E <: Node](val traversal: Iterator[E]) extends AnyVal

Attributes

Graph
Supertypes
class AnyVal
trait Matchable
class Any

Members list

Concise view

Type members

Types

type Traversal[A] = Iterator[A]

Value members

Concrete methods

def both: Iterator[Node]

follow incoming and outgoing edges to adjacent nodes

follow incoming and outgoing edges to adjacent nodes

Attributes

def both(labels: String*): Iterator[Node]

follow incoming and outgoing edges of given labels to adjacent nodes

follow incoming and outgoing edges of given labels to adjacent nodes

Attributes

def bothE: Iterator[Edge]

follow incoming and outgoing edges

follow incoming and outgoing edges

Attributes

def bothE(labels: String*): Iterator[Edge]

follow incoming and outgoing edges of given label

follow incoming and outgoing edges of given label

Attributes

def hasId(value: Long): Iterator[E]

alias for

alias for

id

Attributes

def hasId(values: Long*): Iterator[E]

alias for

alias for

id

Attributes

def id: Iterator[Long]
def id(value: Long): Iterator[E]

Filter by given id Note: do not use as the first step in a traversal, e.g. traversalSource.all.id(value). Use traversalSource.withId instead, it is much faster

Filter by given id Note: do not use as the first step in a traversal, e.g. traversalSource.all.id(value). Use traversalSource.withId instead, it is much faster

Attributes

def id(values: Long*): Iterator[E]

Filter by given ids Note: do not use as the first step in a traversal, e.g. traversalSource.all.id(value). Use traversalSource.withId instead, it is much faster

Filter by given ids Note: do not use as the first step in a traversal, e.g. traversalSource.all.id(value). Use traversalSource.withId instead, it is much faster

Attributes

def in: Iterator[Node]

follow incoming edges to adjacent nodes

follow incoming edges to adjacent nodes

Attributes

def in(labels: String*): Iterator[Node]

follow incoming edges of given label to adjacent nodes

follow incoming edges of given label to adjacent nodes

Attributes

def inE: Iterator[Edge]

follow incoming edges

follow incoming edges

Attributes

def inE(labels: String*): Iterator[Edge]

follow incoming edges of given label

follow incoming edges of given label

Attributes

def out: Iterator[Node]

follow outgoing edges to adjacent nodes

follow outgoing edges to adjacent nodes

Attributes

def out(labels: String*): Iterator[Node]

follow outgoing edges of given labels to adjacent nodes

follow outgoing edges of given labels to adjacent nodes

Attributes

def outE: Iterator[Edge]

follow outgoing edges

follow outgoing edges

Attributes

def outE(labels: String*): Iterator[Edge]

follow outgoing edges of given label

follow outgoing edges of given label

Attributes

Concrete fields

val traversal: Iterator[E]