scalax.collection

GraphEdge

object GraphEdge

This object serves as a container for all edge-types to be used in the context of Graph. You will usually simply import all its members along with the members of GraphParam:

import scalax.collection.GraphPredef._, scalax.collection.GraphEdge,_
Linear Supertypes
AnyRef, Any
Content Hierarchy Learn more about scaladoc diagrams
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. GraphEdge
  2. AnyRef
  3. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Type Members

  1. class DiEdge[N] extends UnDiEdge[N] with DiEdgeLike[N] with EdgeCopy[DiEdge] with EdgeIn[N, DiEdge]

    Represents a directed edge (arc / arrow) connecting two nodes.

  2. trait DiEdgeLike[+N] extends DiHyperEdgeLike[N]

  3. class DiHyperEdge[N] extends HyperEdge[N] with DiHyperEdgeLike[N] with EdgeCopy[DiHyperEdge] with EdgeIn[N, DiHyperEdge]

    Represents a directed edge (link) in a hypergraph with unlimited number of nodes.

  4. trait DiHyperEdgeLike[+N] extends EdgeLike[N]

    Template trait for directed edges.

  5. trait EdgeCompanion[+E[N] <: EdgeLike[N]] extends EdgeCompanionBase[E]

    The abstract methods of this trait must be implemented by companion objects of simple (non-weighted, non-labeled) edges.

  6. trait EdgeCompanionBase[+E[N] <: EdgeLike[N]] extends AnyRef

    Marker trait for companion objects of any kind of edge.

  7. trait EdgeCopy[+CC[X] <: EdgeLike[_]] extends AnyRef

    This trait is to be mixed in by every class implementing EdgeLike.

  8. case class EdgeException(msg: String) extends Exception with Product with Serializable

  9. trait EdgeLike[+N] extends Iterable[N] with Serializable

    Template for Edges in a Graph.

  10. trait ExtendedKey[N] extends EdgeLike[N]

    This trait supports extending the default key of an edge with additional attributes.

  11. class HyperEdge[N] extends EdgeLike[N] with EdgeCopy[HyperEdge] with EdgeIn[N, HyperEdge]

    Represents an undirected hyperedge (hyperlink) in a hypergraph with unlimited number of nodes.

  12. trait HyperEdgeCompanion[+E[N] <: EdgeLike[N]] extends EdgeCompanionBase[E]

    The abstract methods of this trait must be implemented by companion objects of simple (non-weighted, non-labeled) hyperedges.

  13. trait LoopFreeEdge[N] extends EdgeLike[N]

  14. class UnDiEdge[N] extends HyperEdge[N] with EdgeCopy[UnDiEdge] with EdgeIn[N, UnDiEdge]

    Represents an undirected edge.

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 DiEdge extends EdgeCompanion[DiEdge] with Serializable

    Factory for directed edges.

  7. object DiEdgeLike extends Serializable

  8. object DiHyperEdge extends HyperEdgeCompanion[DiHyperEdge] with Serializable

    Factory for directed hyper-edges.

  9. object EdgeLike extends Serializable

  10. object ExtendedKey extends Serializable

  11. object HyperEdge extends HyperEdgeCompanion[HyperEdge] with Serializable

    Factory for undirected hyper-edges.

  12. object LoopFreeEdge extends Serializable

  13. object NodeProduct

    Helper object to convert edge-factory parameter-lists to tuple-n or list.

  14. object UnDiEdge extends EdgeCompanion[UnDiEdge] with Serializable

    Factory for undirected edges.

  15. final def asInstanceOf[T0]: T0

    Definition Classes
    Any
  16. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  17. final def eq(arg0: AnyRef): Boolean

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

    Definition Classes
    AnyRef → Any
  19. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  20. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any
  21. def hashCode(): Int

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

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

    Definition Classes
    AnyRef
  24. final def notify(): Unit

    Definition Classes
    AnyRef
  25. final def notifyAll(): Unit

    Definition Classes
    AnyRef
  26. final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes
    AnyRef
  27. def toString(): String

    Definition Classes
    AnyRef → Any
  28. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  29. final def wait(arg0: Long, arg1: Int): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  30. final def wait(arg0: Long): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  31. val ~: UnDiEdge.type

    $SHORTCUT edge match {case n1 ~ n2 => f(n1, n2)}.

  32. val ~>: DiEdge.type

    $SHORTCUT edge match {case source ~> target => f(source, target)}.

  33. val ~~: HyperEdge.type

    $SHORTCUT hyperedge match {case n1 ~~ (n2, n3) => f(n1, n2, n3)}.

  34. val ~~>: DiHyperEdge.type

    $SHORTCUT diHyperedge match {case source ~~ (t1, t2) => f(source, t1, t2)}.

Inherited from AnyRef

Inherited from Any

Ungrouped