Component

abstract def edges: Set[GraphTraversal.EdgeT]

abstract def nodes: Set[NodeT]

abstract def ordering: GraphTraversal.ElemOrdering

If a NodeOrdering or EdgeOrdering different from noOrdering is supplied neighbor nodes will be sorted during the traversal.

abstract def parameters: Parameters

The properties controlling subsequent traversals.

abstract def root: NodeT

The node where subsequent graph traversals start.

abstract def subgraphEdges: (GraphTraversal.EdgeT) ⇒ Boolean

Restricts subsequent graph traversals to walk only along edges that hold this predicate.

abstract def subgraphNodes: (NodeT) ⇒ Boolean

Restricts subsequent graph traversals to visit only nodes holding this predicate.

final def !=(arg0: Any): Boolean

final def ##(): Int

def +(other: String): String

def ->[B](y: B): (Component, B)

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def ensuring(cond: (Component) ⇒ Boolean, msg: ⇒ Any): Component

def ensuring(cond: (Component) ⇒ Boolean): Component

def ensuring(cond: Boolean, msg: ⇒ Any): Component

def ensuring(cond: Boolean): Component

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

def formatted(fmtstr: String): String

final def getClass(): Class[_]

def hashCode(): Int

def isDefined: Boolean

def isEdge: Boolean

def isIn: Boolean

final def isInstanceOf[T0]: Boolean

def isNode: Boolean

def isOut: Boolean

val n1: Component

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def stringPrefix: String

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

def toGraph: Graph[N, E]

def toParArray: ParArray[T]

def toString(): String

val value: Component

final def wait(): Unit

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

final def wait(arg0: Long): Unit

def ~[N >: N1, N2 <: N](n2: N2): UnDiEdge[N]

def ~>[N >: N1, N2 <: N](n2: N2): DiEdge[N]

def →[B](y: B): (Component, B)

def toString(): String