object Graph extends ImmutableGraphCompanion[Graph] with Serializable
- Alphabetic
- By Inheritance
- Graph
- Serializable
- ImmutableGraphCompanion
- GraphConstrainedCompanion
- GraphCompanion
- GraphCompanionCanBuildFrom
- AnyRef
- Any
- Hide All
- Show All
- Public
- Protected
Type Members
- type Coll = Graph[Nothing, Nothing]
- Attributes
- protected
- Definition Classes
- GraphCompanion
- type Config = ConstrainedConfig
- Definition Classes
- GraphConstrainedCompanion → GraphCompanion
- class GraphCanBuildFrom[N, E[+X] <: EdgeLikeIn[X]] extends BuildFrom[Coll, Param[N, E], CC[N, E]]
- Definition Classes
- GraphCompanionCanBuildFrom
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
- def apply[N, E[+X] <: EdgeLikeIn[X]](elems: Param[N, E]*)(implicit edgeT: ClassTag[E[N]], config: Config): Graph[N, E]
- Definition Classes
- GraphCompanion
- 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()
- def defaultConfig: ConstrainedConfig
- Definition Classes
- GraphConstrainedCompanion → GraphCompanion
- def empty[N, E[+X] <: EdgeLikeIn[X]](implicit edgeT: ClassTag[E[N]], config: Config): Graph[N, E]
- Definition Classes
- Graph → GraphCompanion
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef → Any
- def fill[N, E[+X] <: EdgeLikeIn[X]](nr: Int)(elem: => Param[N, E])(implicit edgeT: ClassTag[E[N]], config: Config): Graph[N, E]
- Definition Classes
- GraphCompanion
- def from[N, E[+X] <: EdgeLikeIn[X]](nodes: Iterable[N], edges: Iterable[E[N]])(implicit edgeT: ClassTag[E[N]], config: Config): Graph[N, E]
- Definition Classes
- Graph → GraphCompanion
- def from[N, E[+X] <: EdgeLikeIn[X]](elems: IterableOnce[Param[N, E]])(implicit edgeT: ClassTag[E[N]], config: Config): Graph[N, E]
- Definition Classes
- GraphCompanion
- def fromWithoutCheck[N, E[+X] <: EdgeLikeIn[X]](nodes: Iterable[N], edges: Iterable[E[N]])(implicit edgeT: ClassTag[E[N]], config: Config): Graph[N, E]
Same as
from
except for constraint being suppressed.Same as
from
except for constraint being suppressed.- Attributes
- protected[collection]
- Definition Classes
- Graph → GraphConstrainedCompanion
- 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
- def newBuilder[N, E[+X] <: EdgeLikeIn[X]](implicit edgeT: ClassTag[E[N]], config: Config): Builder[Param[N, E], Graph[N, E]]
- Definition Classes
- GraphConstrainedCompanion → GraphCompanion
- 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
- 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])