Packages

object Implicits

Linear Supertypes
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Implicits
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Type Members

  1. final class LDiEdgeAssoc [N] extends AnyRef
  2. final class LDiHyperEdgeAssoc [N] extends AnyRef
  3. final class LHyperEdgeAssoc [N] extends AnyRef
  4. final class LUnDiEdgeAssoc [N] extends AnyRef
  5. final class WDiEdgeAssoc [N] extends AnyRef
  6. final class WDiHyperEdgeAssoc [N] extends AnyRef
  7. final class WHyperEdgeAssoc [N] extends AnyRef
  8. final class WUnDiEdgeAssoc [N] extends AnyRef
  9. final class XEdgeAssoc [N1] extends AnyRef
  10. final class XHyperEdgeAssoc [NOld] extends AnyRef

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. implicit def any2XEdgeAssoc[N1](n: N1): XEdgeAssoc[N1]
  5. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  6. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  7. implicit def edge2LDiEdgeAssoc[N](e: DiEdge[N]): LDiEdgeAssoc[N]
  8. implicit def edge2LDiHyperEdgeAssoc[N](e: DiHyperEdge[N]): LDiHyperEdgeAssoc[N]
  9. implicit def edge2LHyperEdgeAssoc[N](e: HyperEdge[N]): LHyperEdgeAssoc[N]
  10. implicit def edge2LUnDiEdgeAssoc[N](e: UnDiEdge[N]): LUnDiEdgeAssoc[N]
  11. implicit def edge2WDiEdgeAssoc[N](e: DiEdge[N]): WDiEdgeAssoc[N]
  12. implicit def edge2WDiHyperEdgeAssoc[N](e: DiHyperEdge[N]): WDiHyperEdgeAssoc[N]
  13. implicit def edge2WHyperEdgeAssoc[N](e: HyperEdge[N]): WHyperEdgeAssoc[N]
  14. implicit def edge2WUnDiEdgeAssoc[N](e: UnDiEdge[N]): WUnDiEdgeAssoc[N]
  15. implicit def edge2XHyperEdgeAssoc[NOld](e: EdgeLike[NOld]): XHyperEdgeAssoc[NOld]
  16. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  17. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  18. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  19. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
  20. def hashCode(): Int
    Definition Classes
    AnyRef → Any
  21. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  22. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  23. final def notify(): Unit
    Definition Classes
    AnyRef
  24. final def notifyAll(): Unit
    Definition Classes
    AnyRef
  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( ... )
  30. object %

    Weight extractor to be combined with :~ or :~>.

  31. object %+

    Weight and label extractor to be combined with :~ or :~>.

  32. object +

    Label extractor to be combined with :~ or :~>.

  33. object :~

    Extractors for weighted and/or labeled undirected edges.

    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) }
  34. object :~>

    Extractors for weighted and/or labeled directed edges.

    Extractors for weighted and/or labeled directed edges.

    object StringLabel extends LEdgeImplicits[String]
    import StringLabel._
    
    val lDi = (n1 ~+> n2)(label)
    lDi match { case LDiEdge(s, t, l) => f(s, t, l) } // constructor pattern
    lDi match { case s :~> t + l      => f(s, t, l) } // infix op pattern
    
    val lkDi = (n1 ~+#> n2)(label)
    lkDi match { case s :~> t + l     => f(s, t, l) }

Inherited from AnyRef

Inherited from Any

Ungrouped