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 EdgeOut:

import scalax.collection.GraphPredef._, scalax.collection.EdgeOut._
Linear Supertypes
AnyRef, Any
Content Hierarchy Learn more about scaladoc diagrams
EdgeOut[NI, EI, NO, EO]EdgeIn[NI, EI]DiHyperEdgeLikeIn[N]EdgeLikeIn[N]GraphParamEdgeNodeOut[NI]NodeIn[NI]GraphParamNode[N]GraphParamOut[NO, EO]GraphParamIn[NI, EI]GraphParam[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 EdgeIn[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. trait EdgeIn[NI, +EI[X <: NI] <: EdgeLike[X]] extends GraphParamIn[NI, EI] with GraphParamEdge

    Classes implementing EdgeLike must be instantiated mixing in this trait.

  4. type EdgeLikeIn[N] = EdgeLike[N] with EdgeCopy[EdgeLike] with EdgeIn[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.

  5. trait EdgeOut[NI, +EI[X <: NI] <: EdgeLike[X], NO <: NodeOut[NI], +EO[X <: NO] <: EdgeLike[X]] extends GraphParamOut[NI, EI] with GraphParamEdge

  6. sealed trait GraphParam[N, +E[X <: N] <: EdgeLike[X]] extends AnyRef

    This algebraic type serves as the type parameter to SetLike.

  7. sealed trait GraphParamEdge extends AnyRef

  8. sealed trait GraphParamIn[NI, +EI[X <: NI] <: EdgeLike[X]] extends GraphParam[NI, EI]

  9. trait GraphParamNode[N] extends AnyRef

  10. sealed trait GraphParamOut[NO, +EO[X <: NO] <: EdgeLike[X]] extends GraphParam[NO, EO]

  11. implicit final class HyperEdgeAssoc[NOld] extends AnyVal

  12. case class NodeIn[NI](value: NI) extends GraphParamIn[NI, Nothing] with GraphParamNode[NI] with Product with Serializable

  13. trait NodeOut[NI] extends GraphParamOut[NI, Nothing] with GraphParamNode[NI]

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 EdgeOut

  7. object GraphParam

  8. object NodeOut

  9. implicit def anyToNode[N](n: N): NodeIn[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. final def eq(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  13. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  14. def finalize(): Unit

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

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

    Definition Classes
    AnyRef → Any

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

  17. def hashCode(): Int

    Definition Classes
    AnyRef → Any

  18. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

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

    Definition Classes
    AnyRef

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

  21. final def notify(): Unit

    Definition Classes
    AnyRef

  22. final def notifyAll(): Unit

    Definition Classes
    AnyRef

  23. implicit def predicateToNodePredicate[NI, EI[X <: NI] <: EdgeLike[X], NO <: NodeOut[NI], EC[X <: NO] <: EdgeLike[X]](p: (NI) ⇒ Boolean): (GraphParam[NI, EI]) ⇒ Boolean

    Annotations
    @inline()

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

    Annotations
    @inline()

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

    Definition Classes
    AnyRef

  26. def toString(): String

    Definition Classes
    AnyRef → Any

  27. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from AnyRef

Inherited from Any

Ungrouped