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) }
- Alphabetic
- By Inheritance
- :~
- AnyRef
- Any
- Hide All
- Show All
- Public
- Protected
Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##: Int
- Definition Classes
- AnyRef → Any
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native() @HotSpotIntrinsicCandidate()
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef → Any
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- def hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def toString(): String
- Definition Classes
- AnyRef → Any
- def unapply[N](e: WkLkUnDiEdge[N]): Option[(N, (N, Double, WLUnDiEdge.L1))]
- def unapply[N](e: WkLUnDiEdge[N]): Option[(N, (N, Double, WLUnDiEdge.L1))]
- def unapply[N](e: WLkUnDiEdge[N]): Option[(N, (N, Double, WLUnDiEdge.L1))]
- def unapply[N](e: WLUnDiEdge[N]): Option[(N, (N, Double, WLUnDiEdge.L1))]
- def unapply[N](e: LkUnDiEdge[N]): Option[(N, (N, LUnDiEdge.L1))]
- def unapply[N](e: LUnDiEdge[N]): Option[(N, (N, LUnDiEdge.L1))]
- def unapply[N](e: WkUnDiEdge[N]): Option[(N, (N, Double))]
- def unapply[N](e: WUnDiEdge[N]): Option[(N, (N, Double))]
- final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
Welcome to the Graph for Scala API reference. Some suggested navigation entry points:
Graph
mutable.Graph
and its inner nodes.GraphEdge
objectedge
packageGraphPredef
object andImplicits
object.GraphTraversal
andTraverserInnerNode
.RandomGraph
.GraphGen
.