BaseEdgeSequencePathType

Instance Constructors

new BaseEdgeSequencePathType(edgeTypes: Array[Int], reverse: Array[Boolean])

Abstract Value Members

abstract def cacheVertexInformation(vertex: Vertex, hopNum: Int): PathTypeVertexCache

Definition Classes
PathType
abstract def getNextEdgeType(hopNum: Int, vertex: Vertex, random: Random, cache: PathTypeVertexCache): Int

Attributes
protected

Concrete Value Members

final def !=(arg0: Any): Boolean

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

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

Definition Classes
AnyRef → Any
final def asInstanceOf[T0]: T0

Definition Classes
Any
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
val edgeTypes: Array[Int]
def encodeAsHumanReadableString(graph: Graph, edgeMap: Map[Int, String] = Map()): String

Creates a human-digestable representation of the PathType.
Creates a human-digestable representation of the PathType. To make it human readable, we need to convert the integers that show up in the path type into their string representations, using the provided dictionaries.

Definition Classes
BaseEdgeSequencePathType → PathType
def encodeAsString(): String

Creates a machine-parseable representation of the PathType.
Creates a machine-parseable representation of the PathType. This must match the ObjectParser[PathType] implementation in the PathTypeFactory. Edges types, node types, and whatever else, are encoded as integers.

Definition Classes
BaseEdgeSequencePathType → PathType
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def equals(other: Any): Boolean

Definition Classes
BaseEdgeSequencePathType → AnyRef → Any
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def getEdgeTypes(): Array[Int]
def getReverse(): Array[Boolean]
def hashCode(): Int

Definition Classes
BaseEdgeSequencePathType → AnyRef → Any
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
def isLastHop(hopNum: Int): Boolean

Is this the last hop? This determines whether the walk gets sent to the companion for tracking statistics.
Is this the last hop? This determines whether the walk gets sent to the companion for tracking statistics.

Definition Classes
BaseEdgeSequencePathType → PathType
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def nextHop(hopNum: Int, sourceVertex: Int, currentVertex: Vertex, random: Random, edgeExcluder: EdgeExcluder, cache: PathTypeVertexCache): Int

Given the hop number and information about the current vertex, pick an edge to follow.
Given the hop number and information about the current vertex, pick an edge to follow.
The EdgeExcluder is an object that uses some global or external information to determine if the walk is not allowed, generally because it's using an edge from the test data, or an edge that we're trying to learn.
It is advisable, if at all possible, to do whatever you can to avoid looping over all of the edges in this method. This is in the inner loop of the PathFollower, and so it will get run a _lot_. Even worse, the processing is distributed across threads by vertex, and if you loop over all of the edges, you make the amount of computation done by each thread more uneven, because vertices that have lots of edges tend to get more walks at them. So, really, try hard to avoid a loop over all of the edges. The cache parameter should be helpful for that.

Definition Classes
BaseEdgeSequencePathType → PathType
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
val numHops: Int
def recommendedIters(): Int

How many iterations should we run if we want to be sure we complete the computation for this path type?
How many iterations should we run if we want to be sure we complete the computation for this path type?

Definition Classes
BaseEdgeSequencePathType → PathType
val reverse: Array[Boolean]
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toString(): String

Definition Classes
BaseEdgeSequencePathType → AnyRef → Any
final def wait(): Unit

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

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

Definition Classes
AnyRef
Annotations
@throws( ... )

Related Doc: package features

abstract class BaseEdgeSequencePathType extends PathType

Instance Constructors

new BaseEdgeSequencePathType(edgeTypes: Array[Int], reverse: Array[Boolean])

Abstract Value Members

abstract def cacheVertexInformation(vertex: Vertex, hopNum: Int): PathTypeVertexCache

abstract def getNextEdgeType(hopNum: Int, vertex: Vertex, random: Random, cache: PathTypeVertexCache): Int

Concrete Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

val edgeTypes: Array[Int]

def encodeAsHumanReadableString(graph: Graph, edgeMap: Map[Int, String] = Map()): String

def encodeAsString(): String

final def eq(arg0: AnyRef): Boolean

def equals(other: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def getEdgeTypes(): Array[Int]

def getReverse(): Array[Boolean]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

def isLastHop(hopNum: Int): Boolean

final def ne(arg0: AnyRef): Boolean

def nextHop(hopNum: Int, sourceVertex: Int, currentVertex: Vertex, random: Random, edgeExcluder: EdgeExcluder, cache: PathTypeVertexCache): Int

final def notify(): Unit

final def notifyAll(): Unit

val numHops: Int

def recommendedIters(): Int

val reverse: Array[Boolean]

final def synchronized[T0](arg0: ⇒ T0): T0

def toString(): String

final def wait(): Unit

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit

Inherited from PathType

Inherited from AnyRef

Inherited from Any

Ungrouped