Object

scalax.collection

GraphPredef

Related Doc: package collection

Permalink

object GraphPredef

This object serves as a container for several Graph-related definitions like parameter-types and implicit conversions.

You will usually simply import all its members along with the members of InnerEdgeParam:

import scalax.collection.GraphPredef._, scalax.collection.InnerEdgeParam._
Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. GraphPredef
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Type Members

  1. type DiEdgeLikeIn[+N] = DiEdgeLike[N] with EdgeCopy[DiEdgeLike] with OuterEdge[N, DiEdgeLike]

    Permalink

    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.

  2. type DiHyperEdgeLikeIn[+N] = DiHyperEdgeLike[N] with EdgeCopy[DiHyperEdgeLike] with OuterEdge[N, DiHyperEdgeLike]

    Permalink

    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.

  3. implicit final class EdgeAssoc[N1] extends AnyVal

    Permalink

  4. type EdgeLikeIn[+N] = EdgeLike[N] with EdgeCopy[EdgeLike] with OuterEdge[N, EdgeLike]

    Permalink

    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.

  5. sealed trait EdgeParam extends AnyRef

    Permalink

  6. implicit final class HyperEdgeAssoc[NOld] extends AnyVal

    Permalink

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

    Permalink

    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.

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

    Permalink

    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.

  9. trait InnerNodeParam[+NI] extends OutParam[NI, Nothing] with NodeParam[NI]

    Permalink

    NI

    the type of the nodes (vertices) this graph is passed to by the user.

  10. trait NodeParam[+N] extends AnyRef

    Permalink

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

    Permalink

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

    Permalink

    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.

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

    Permalink

    Same as InParam.

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

    Permalink

    NI

    the type of the nodes (vertices) this graph is passed to by the user.

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

    Permalink

    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

  1. final def !=(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  3. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  4. object InnerEdgeParam

    Permalink

  5. object InnerNodeParam

    Permalink

  6. object Param

    Permalink

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

    Permalink
    Annotations
    @inline()

  8. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

  9. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Permalink

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

    Permalink

  12. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef

  13. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  14. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )

  15. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any

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

    Permalink

  17. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  18. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

  19. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef

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

    Permalink

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

    Permalink

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

    Permalink

  23. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  24. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

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

    Permalink
    Annotations
    @inline()

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

    Permalink

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

    Permalink
    Definition Classes
    AnyRef

  28. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any

  29. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  31. final def wait(arg0: Long): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from AnyRef

Inherited from Any

Ungrouped