object Implicits
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- Implicits
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- Protected
Type Members
- final class LDiEdgeAssoc[N] extends AnyRef
- final class LDiHyperEdgeAssoc[N] extends AnyRef
- final class LHyperEdgeAssoc[N] extends AnyRef
- final class LUnDiEdgeAssoc[N] extends AnyRef
- final class WDiEdgeAssoc[N] extends AnyRef
- final class WDiHyperEdgeAssoc[N] extends AnyRef
- final class WHyperEdgeAssoc[N] extends AnyRef
- final class WUnDiEdgeAssoc[N] extends AnyRef
- final class XEdgeAssoc[N1] extends AnyRef
- final class XHyperEdgeAssoc[NOld] extends AnyRef
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
- implicit def any2XEdgeAssoc[N1](n: N1): XEdgeAssoc[N1]
- 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()
- implicit def edge2LDiEdgeAssoc[N](e: DiEdge[N]): LDiEdgeAssoc[N]
- implicit def edge2LDiHyperEdgeAssoc[N](e: DiHyperEdge[N]): LDiHyperEdgeAssoc[N]
- implicit def edge2LHyperEdgeAssoc[N](e: HyperEdge[N]): LHyperEdgeAssoc[N]
- implicit def edge2LUnDiEdgeAssoc[N](e: UnDiEdge[N]): LUnDiEdgeAssoc[N]
- implicit def edge2WDiEdgeAssoc[N](e: DiEdge[N]): WDiEdgeAssoc[N]
- implicit def edge2WDiHyperEdgeAssoc[N](e: DiHyperEdge[N]): WDiHyperEdgeAssoc[N]
- implicit def edge2WHyperEdgeAssoc[N](e: HyperEdge[N]): WHyperEdgeAssoc[N]
- implicit def edge2WUnDiEdgeAssoc[N](e: UnDiEdge[N]): WUnDiEdgeAssoc[N]
- implicit def edge2XHyperEdgeAssoc[NOld](e: EdgeLike[NOld]): XHyperEdgeAssoc[NOld]
- 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
- implicit def lEdge2LDiEdgeAssoc[N](e: LDiEdge[N]): LDiEdgeAssoc[N]
- 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
- implicit def wEdge2WDiEdgeAssoc[N](e: WDiEdge[N]): WDiEdgeAssoc[N]
- 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])
- object %
Weight extractor to be combined with
:~or:~>. - object %+
Weight and label extractor to be combined with
:~or:~>. - object +
Label extractor to be combined with
:~or:~>. - 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) }
- 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) }
Welcome to the Graph for Scala API reference. Some suggested navigation entry points:
Graphmutable.Graphand its inner nodes.GraphEdgeobjectedgepackageGraphPredefobject andImplicitsobject.GraphTraversalandTraverserInnerNode.RandomGraph.GraphGen.