flatgraph-core
API
Generated with
flatgraph-core/flatgraph/flatgraph.traversal/NodeSteps

NodeSteps

flatgraph.traversal.NodeSteps
final class NodeSteps[A <: GNode](traversal: Iterator[A]) extends AnyVal

Attributes

Graph
Supertypes
class AnyVal
trait Matchable
class Any

Members list

Value members

Concrete methods

def hasLabel(value: String): Iterator[A]

alias for

alias for

label

Attributes

def hasLabel(values: String*): Iterator[A]

alias for

alias for

label

Attributes

def id: Iterator[Long]

id combines nodeKind and seq into a unique id Mostly for backwards compatibility with overflowdb v1 where nodes have a id: Long

id combines nodeKind and seq into a unique id Mostly for backwards compatibility with overflowdb v1 where nodes have a id: Long

Attributes

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

filter by id

filter by id

Attributes

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

filter by ids

filter by ids

Attributes

def in: Iterator[GNode]

follow all IN edges to their adjacent nodes

follow all IN edges to their adjacent nodes

Attributes

def in(edgeLabel: String): Iterator[GNode]

follow the given IN edge(s) to their adjacent nodes

follow the given IN edge(s) to their adjacent nodes

Attributes

def inE: Iterator[Edge]

lookup all IN edge(s)

lookup all IN edge(s)

Attributes

def inE(edgeLabel: String): Iterator[Edge]

lookup the given IN edge(s)

lookup the given IN edge(s)

Attributes

def label: Iterator[String]

traverse to the node label

traverse to the node label

Attributes

def label(value: String): Iterator[A]

filter by the node label

filter by the node label

Attributes

def label(values: String*): Iterator[A]

filter by the node labels

filter by the node labels

Attributes

def labelNot(value: String): Iterator[A]

filter by the node label (inverse)

filter by the node label (inverse)

Attributes

def labelNot(value1: String, valueN: String*): Iterator[A]

filter by the node labels (inverse)

filter by the node labels (inverse)

Attributes

def out: Iterator[GNode]

follow all OUT edges to their adjacent nodes

follow all OUT edges to their adjacent nodes

Attributes

def out(edgeLabel: String): Iterator[GNode]

follow the given OUT edge(s) to their adjacent nodes

follow the given OUT edge(s) to their adjacent nodes

Attributes

def outE: Iterator[Edge]

lookup all OUT edge(s)

lookup all OUT edge(s)

Attributes

def outE(edgeLabel: String): Iterator[Edge]

lookup the given OUT edge(s)

lookup the given OUT edge(s)

Attributes

def property[T](name: String): Iterator[T]
def property[ValueType](propertyKey: PropertyKey[ValueType, _]): Iterator[ValueType]
def property[ValueType](propertyKey: SinglePropertyKey[ValueType]): Iterator[ValueType]
def property[ValueType](propertyKey: OptionalPropertyKey[ValueType]): Iterator[ValueType]
def property[ValueType](propertyKey: MultiPropertyKey[ValueType]): Iterator[ValueType]
Generated with