Type Members
-
-
-
class
GraphCanBuildFrom[N, E[X] <: EdgeLikeIn[X]] extends CanBuildFrom[Coll, Param[N, E], CC[N, E]]
Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: Any): Boolean
-
def
apply[N, E[X] <: EdgeLikeIn[X]](elems: Param[N, E]*)(implicit edgeT: ClassTag[E[N]], config: Config): Graph[N, E]
-
final
def
asInstanceOf[T0]: T0
-
def
clone(): AnyRef
-
-
def
empty[N, E[X] <: EdgeLikeIn[X]](implicit edgeT: ClassTag[E[N]], config: Config): Graph[N, E]
-
-
-
def
fill[N, E[X] <: EdgeLikeIn[X]](nr: Int)(elem: ⇒ Param[N, E])(implicit edgeT: ClassTag[E[N]], config: Config): Graph[N, E]
-
def
finalize(): Unit
-
def
from[N, E[X] <: EdgeLikeIn[X]](nodes: Traversable[N], edges: Traversable[E[N]])(implicit edgeT: ClassTag[E[N]], config: Config): Graph[N, E]
-
def
fromUnchecked[N, E[X] <: EdgeLikeIn[X]](nodes: Traversable[N], edges: Traversable[E[N]])(implicit edgeT: ClassTag[E[N]], config: Config): DefaultGraphImpl[N, E]
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
final
def
isInstanceOf[T0]: Boolean
-
-
def
newBuilder[N, E[X] <: EdgeLikeIn[X]](implicit edgeT: ClassTag[E[N]], config: Config): Builder[Param[N, E], Graph[N, E]]
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
toString(): String
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
Inherited from Serializable
Inherited from GraphCompanion[Graph]