Packages

  • package root

    Welcome to the Graph for Scala API reference.

    Welcome to the Graph for Scala API reference. Some suggested navigation entry points:

    Definition Classes
    root
  • package scalax
    Definition Classes
    root
  • package collection

    Contains the base traits and objects needed to use Graph for Scala.

    Contains the base traits and objects needed to use Graph for Scala.

    See also the Graph for Scala Core User Guide.

    Definition Classes
    scalax
  • package edge

    Predefined edges.

    Predefined edges.

    While basic edge types are defined in the object GraphEdge, the predefined edges in this package cover the following categories (prefixes, shortcuts):

    weighted (W, %), key-weighted (Wk, %#), labeled (L, +), key-labeled (Lk, +#), weighted and labeled (WL, %+), key-weighted and labeled (WkL, %#+), weighted and key-labeled (WLk, %+#) and key-weighted and key-labeled (WkLk, %#+#).

    These predefined edges provide alternatives for any edge extension taking the burden from the user to implement his/her custom edge class - but baring the disadvantage that user edge attributes must be part of a label class as opposed to being part of the edge class directly. It may also serve as a source for looking up how to implement custom edge classes.

    Definition Classes
    collection
  • object Implicits
    Definition Classes
    edge
  • %
  • %+
  • +
  • :~
  • :~>
  • LDiEdgeAssoc
  • LDiHyperEdgeAssoc
  • LHyperEdgeAssoc
  • LUnDiEdgeAssoc
  • WDiEdgeAssoc
  • WDiHyperEdgeAssoc
  • WHyperEdgeAssoc
  • WUnDiEdgeAssoc
  • XEdgeAssoc
  • XHyperEdgeAssoc

object :~

Extractors for weighted and/or labeled undirected edges.

object StringLabel extends LEdgeImplicits[String]
import StringLabel._

val lE = (n1 ~+ n2)(label)
lE match { case LUnDiEdge(s, t, l) => f(s, t, l) } // constructor pattern
lE match { case s :~ t + l         => f(s, t, l) } // infix op pattern

val lkE = (n1 ~+# n2)(label)
lkE match { case s :~ t + l => f(s, t, l) }
Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. :~
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  4. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  5. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  6. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  7. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  8. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  9. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  10. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  11. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  12. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  13. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  14. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  15. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  16. def toString(): String
    Definition Classes
    AnyRef → Any
  17. def unapply[N](e: WkLkUnDiEdge[N]): Option[(N, (N, Double, WLUnDiEdge.L1))]
  18. def unapply[N](e: WkLUnDiEdge[N]): Option[(N, (N, Double, WLUnDiEdge.L1))]
  19. def unapply[N](e: WLkUnDiEdge[N]): Option[(N, (N, Double, WLUnDiEdge.L1))]
  20. def unapply[N](e: WLUnDiEdge[N]): Option[(N, (N, Double, WLUnDiEdge.L1))]
  21. def unapply[N](e: LkUnDiEdge[N]): Option[(N, (N, LUnDiEdge.L1))]
  22. def unapply[N](e: LUnDiEdge[N]): Option[(N, (N, LUnDiEdge.L1))]
  23. def unapply[N](e: WkUnDiEdge[N]): Option[(N, (N, Double))]
  24. def unapply[N](e: WUnDiEdge[N]): Option[(N, (N, Double))]
  25. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  26. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  27. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )

Inherited from AnyRef

Inherited from Any

Ungrouped