case class ScalaGraph(traversalSource: TraversalSource) extends Product with Serializable
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- ScalaGraph
- Serializable
- Serializable
- Product
- Equals
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- All
Instance Constructors
- new ScalaGraph(traversalSource: TraversalSource)
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
- def +(label: String, properties: KeyValue[_]*): Vertex
- def +(label: String): Vertex
- def +[CC <: Product](cc: CC)(implicit arg0: Marshallable[CC]): Vertex
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
E(edgeIds: Any*): Aux[Edge, HNil]
start traversal with some edges identified by given ids
-
def
E(): Aux[Edge, HNil]
start traversal with all edges
-
def
V(vertexIds: Any*): Aux[Vertex, HNil]
start traversal with some vertices identified by given ids
-
def
V(): Aux[Vertex, HNil]
start traversal with all vertices
-
def
addE(label: String): Aux[Edge, HNil]
start a traversal with
addV
-
def
addV(label: String): Aux[Vertex, HNil]
start a traversal with
addV
-
def
addV(): Aux[Vertex, HNil]
start a traversal with
addV
-
def
addVertex[CC <: Product](cc: CC)(implicit arg0: Marshallable[CC]): Vertex
Save an object's values as a new vertex Note:
@id
members cannot be set for all graphs (e.g.Save an object's values as a new vertex Note:
@id
members cannot be set for all graphs (e.g. remote graphs), so it is ignored here generally - def addVertex(properties: Map[String, Any]): Vertex
- def addVertex(label: String, properties: Map[String, Any]): Vertex
- def addVertex(label: String, properties: (String, Any)*): Vertex
- def addVertex(properties: (String, Any)*): Vertex
- def addVertex(label: String): Vertex
- def addVertex(): Vertex
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
- def close(): Unit
- def compute(): GraphComputer
- def compute[C <: GraphComputer](graphComputerClass: Class[C]): C
- def configuration(): Configuration
- def configure(conf: (TraversalSource) ⇒ TraversalSource): ScalaGraph
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- lazy val graph: Graph
-
def
inject[S](starts: S*): Aux[S, HNil]
start a traversal with given
starts
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
- lazy val traversal: TraversalSource
- val traversalSource: TraversalSource
- def tx(): Transaction
- def variables(): Variables
-
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
- @native() @throws( ... )