scalax.collection

GraphPredef

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
Content Hierarchy Learn more about scaladoc diagrams
InnerEdgeParam[NI, EI, NO, EO]OuterEdge[NI, EI]DiHyperEdgeLikeIn[N]EdgeLikeIn[N]EdgeParamInnerNodeParam[NI]OuterNode[NI]NodeParam[N]OutParam[NO, EO]OuterElem[N, E]InParam[N, E]Param[N, E]
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. GraphPredef
  2. AnyRef
  3. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Type Members

  1. 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.

  2. implicit final class EdgeAssoc[N1] extends AnyVal

  3. 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.

  4. sealed trait EdgeParam extends AnyRef

  5. implicit final class HyperEdgeAssoc[NOld] extends AnyVal

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

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

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

  9. trait NodeParam[N] extends AnyRef

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

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

    Classes implementing EdgeLike must be instantiated mixing in this trait.

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

    Same as InParam.

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

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

    This algebraic type includes outer and inner nodes and edges.

Value Members

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

    Definition Classes
    AnyRef

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

    Definition Classes
    Any

  3. final def ##(): Int

    Definition Classes
    AnyRef → Any

  4. final def ==(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

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

    Definition Classes
    Any

  6. object InnerEdgeParam

  7. object InnerNodeParam

  8. object Param

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

    Annotations
    @inline()

  10. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

  11. def clone(): AnyRef

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

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

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

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

    Definition Classes
    AnyRef

  15. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  16. def finalize(): Unit

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

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

    Definition Classes
    AnyRef → Any

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

  19. def hashCode(): Int

    Definition Classes
    AnyRef → Any

  20. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

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

    Definition Classes
    AnyRef

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

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

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

  25. final def notify(): Unit

    Definition Classes
    AnyRef

  26. final def notifyAll(): Unit

    Definition Classes
    AnyRef

  27. 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()

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

    Annotations
    @inline()

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

    Definition Classes
    AnyRef

  30. def toString(): String

    Definition Classes
    AnyRef → Any

  31. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from AnyRef

Inherited from Any

Ungrouped