GraphPredef

Type Members

type DiHyperEdgeLikeIn[N] = DiHyperEdgeLike[N] with EdgeCopy[DiHyperEdgeLike] with OuterEdge[N, DiHyperEdgeLike]

Denotes all directed edge types for the E type parameter of a Graph.
Denotes all directed edge types for the E type parameter of a Graph. Supplying this type as the actual type parameter allows to include any kind of directed edges such as directed hyper-edges and directed edges.
implicit final class EdgeAssoc[N1] extends AnyVal
type EdgeLikeIn[N] = EdgeLike[N] with EdgeCopy[EdgeLike] with OuterEdge[N, EdgeLike]

The most generic type for the E type parameter of a Graph.
The most generic type for the E type parameter of a Graph. Supplying this type as the actual type parameter allows to include any kind of edges such as hyper-edges, undirected and directed edges.
sealed trait EdgeParam extends AnyRef
implicit final class HyperEdgeAssoc[NOld] extends AnyVal
sealed trait InParam[N, +E[X <: N] <: EdgeLike[X]] extends Param[N, E]

N
the type of the nodes (vertices) this graph is passed to by the user.
E
the kind of the edges (links) this graph is passed to by the user.
trait InnerEdgeParam[NI, +EI[X <: NI] <: EdgeLike[X], NO <: InnerNodeParam[NI], +EO[X <: NO] <: EdgeLike[X]] extends OutParam[NI, EI] with EdgeParam

NI
the type of the nodes the graph is passed to.
EI
the kind of the edges the graph is passed to.
NO
the type of the nodes created internally.
EO
the kind of the edges created internally.
trait InnerNodeParam[NI] extends OutParam[NI, Nothing] with NodeParam[NI]

NI
the type of the nodes (vertices) this graph is passed to by the user.
trait NodeParam[N] extends AnyRef
sealed trait OutParam[NO, +EO[X <: NO] <: EdgeLike[X]] extends Param[NO, EO]
trait OuterEdge[NI, +EI[X <: NI] <: EdgeLike[X]] extends InParam[NI, EI] with EdgeParam

Classes implementing EdgeLike must be instantiated mixing in this trait.
Classes implementing EdgeLike must be instantiated mixing in this trait. This is a precondition for passing edge-instances to a Graph.
NI
the type of the nodes (vertices) this graph is passed to by the user.
EI
the kind of the edges (links) this graph is passed to by the user.
type OuterElem[N, +E[X <: N] <: EdgeLike[X]] = InParam[N, E]

Same as InParam.
case class OuterNode[NI](value: NI) extends InParam[NI, Nothing] with NodeParam[NI] with Product with Serializable

NI
the type of the nodes (vertices) this graph is passed to by the user.
sealed trait Param[N, +E[X <: N] <: EdgeLike[X]] extends AnyRef

This algebraic type includes outer and inner nodes and edges.
This algebraic type includes outer and inner nodes and edges. As such it serves as the type parameter to SetLike extending Graph.

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
object InnerEdgeParam
object InnerNodeParam
object Param
implicit def anyToNode[N](n: N): OuterNode[N]

Annotations
@inline()
final def asInstanceOf[T0]: T0

Definition Classes
Any
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
implicit def edgeSetToOuter[N, E[X] <: EdgeLikeIn[X]](edges: Graph.EdgeSetT): Iterable[E[N]]
implicit def edgeSetToSeq[N, E[X] <: EdgeLikeIn[X]](edges: Graph.EdgeSetT): Seq[OutParam[N, E]]
final def eq(arg0: AnyRef): Boolean

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

Definition Classes
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
implicit def graphParamsToPartition[N, E[X] <: EdgeLikeIn[X]](elems: Iterable[Param[N, E]]): Partitions[N, E]
def hashCode(): Int

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

Definition Classes
Any
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def nodePredicate[NI, EI[X <: NI] <: EdgeLike[X], NO <: InnerNodeParam[NI], EO[X <: NO] <: EdgeLike[X]](pred: (NI) ⇒ Boolean): (Param[NI, EI]) ⇒ Boolean
implicit def nodeSetToOuter[N, E[X] <: EdgeLikeIn[X]](nodes: Graph.NodeSetT): Iterable[N]
implicit def nodeSetToSeq[N, E[X] <: EdgeLikeIn[X]](nodes: Graph.NodeSetT): Seq[OutParam[N, E]]
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
implicit def predicateToNodePredicate[NI, EI[X <: NI] <: EdgeLike[X], NO <: InnerNodeParam[NI], EC[X <: NO] <: EdgeLike[X]](p: (NI) ⇒ Boolean): (Param[NI, EI]) ⇒ Boolean

Annotations
@inline()
implicit def seqToGraphParam[N, E[X <: N] <: EdgeLikeIn[X]](s: Seq[N]): Seq[InParam[N, E]]

Annotations
@inline()
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toString(): String

Definition Classes
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 collection

object GraphPredef

Type Members

type DiHyperEdgeLikeIn[N] = DiHyperEdgeLike[N] with EdgeCopy[DiHyperEdgeLike] with OuterEdge[N, DiHyperEdgeLike]

implicit final class EdgeAssoc[N1] extends AnyVal

type EdgeLikeIn[N] = EdgeLike[N] with EdgeCopy[EdgeLike] with OuterEdge[N, EdgeLike]

sealed trait EdgeParam extends AnyRef

implicit final class HyperEdgeAssoc[NOld] extends AnyVal

sealed trait InParam[N, +E[X <: N] <: EdgeLike[X]] extends Param[N, E]

trait InnerEdgeParam[NI, +EI[X <: NI] <: EdgeLike[X], NO <: InnerNodeParam[NI], +EO[X <: NO] <: EdgeLike[X]] extends OutParam[NI, EI] with EdgeParam

trait InnerNodeParam[NI] extends OutParam[NI, Nothing] with NodeParam[NI]

trait NodeParam[N] extends AnyRef

sealed trait OutParam[NO, +EO[X <: NO] <: EdgeLike[X]] extends Param[NO, EO]

trait OuterEdge[NI, +EI[X <: NI] <: EdgeLike[X]] extends InParam[NI, EI] with EdgeParam

type OuterElem[N, +E[X <: N] <: EdgeLike[X]] = InParam[N, E]

case class OuterNode[NI](value: NI) extends InParam[NI, Nothing] with NodeParam[NI] with Product with Serializable

sealed trait Param[N, +E[X <: N] <: EdgeLike[X]] extends AnyRef

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

object InnerEdgeParam

object InnerNodeParam

object Param

implicit def anyToNode[N](n: N): OuterNode[N]

final def asInstanceOf[T0]: T0

def clone(): AnyRef

implicit def edgeSetToOuter[N, E[X] <: EdgeLikeIn[X]](edges: Graph.EdgeSetT): Iterable[E[N]]

implicit def edgeSetToSeq[N, E[X] <: EdgeLikeIn[X]](edges: Graph.EdgeSetT): Seq[OutParam[N, E]]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

implicit def graphParamsToPartition[N, E[X] <: EdgeLikeIn[X]](elems: Iterable[Param[N, E]]): Partitions[N, E]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

def nodePredicate[NI, EI[X <: NI] <: EdgeLike[X], NO <: InnerNodeParam[NI], EO[X <: NO] <: EdgeLike[X]](pred: (NI) ⇒ Boolean): (Param[NI, EI]) ⇒ Boolean

implicit def nodeSetToOuter[N, E[X] <: EdgeLikeIn[X]](nodes: Graph.NodeSetT): Iterable[N]

implicit def nodeSetToSeq[N, E[X] <: EdgeLikeIn[X]](nodes: Graph.NodeSetT): Seq[OutParam[N, E]]

final def notify(): Unit

final def notifyAll(): Unit

implicit def predicateToNodePredicate[NI, EI[X <: NI] <: EdgeLike[X], NO <: InnerNodeParam[NI], EC[X <: NO] <: EdgeLike[X]](p: (NI) ⇒ Boolean): (Param[NI, EI]) ⇒ Boolean

implicit def seqToGraphParam[N, E[X <: N] <: EdgeLikeIn[X]](s: Seq[N]): Seq[InParam[N, E]]

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 AnyRef

Inherited from Any

Ungrouped