AstarTraveler

abstract def color(id: Long): VertexColor

The color mark if a vertex was already visited.

abstract def h(v1: Long, v2: Long): Double

The future path-cost function, which is an admissible "heuristic estimate" of the distance from the current vertex to the goal.

abstract def id(key: String): Option[Long]

Translates a vertex string key to 64 bit id.

abstract def neighbors(vertex: Vertex, hops: Int): Iterator[(Long, Edge)]

Returns an iterator of the neighbors and associated edges of a vertex.

abstract def vertex(key: String): Vertex

Returns the vertex of given string key.

abstract def vertex(id: Long): Vertex

Returns the vertex of given ID.

abstract def visit(vertex: Vertex, edge: Option[Edge], hops: Int): Unit

Visit a vertex during graph traversal.

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

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

def weight(edge: Edge): Double

The weight of edge (e.g.