DefaultGraphImpl

Value Members

1. final def !=(arg0: AnyRef): Boolean

   Definition Classes

   AnyRef

2. final def !=(arg0: Any): Boolean

   Definition Classes

   Any

3. final def ##(): Int

   Definition Classes

   AnyRef → Any

4. final def ==(arg0: AnyRef): Boolean

   Definition Classes

   AnyRef

5. final def ==(arg0: Any): Boolean

   Definition Classes

   Any

6. def apply[N, E[X] <: EdgeLikeIn[X]](elems: Param[N, E]*)(implicit edgeT: scala.reflect.api.JavaUniverse.TypeTag[E[N]], config: Config): DefaultGraphImpl[N, E]

   Definition Classes

   GraphCompanion

7. final def asInstanceOf[T0]: T0

   Definition Classes

   Any

8. def clone(): AnyRef

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

9. def defaultConfig: ConstrainedConfig

   Definition Classes

   GraphConstrainedCompanion → GraphCompanion

10. def empty[N, E[X] <: EdgeLikeIn[X]](implicit edgeT: scala.reflect.api.JavaUniverse.TypeTag[E[N]], config: Config): DefaultGraphImpl[N, E]

    Definition Classes

    DefaultGraphImpl → GraphCompanion

11. final def eq(arg0: AnyRef): Boolean

    Definition Classes

    AnyRef

12. def equals(arg0: Any): Boolean

    Definition Classes

    AnyRef → Any

13. def fill[N, E[X] <: EdgeLikeIn[X]](nr: Int)(elem: ⇒ Param[N, E])(implicit edgeT: scala.reflect.api.JavaUniverse.TypeTag[E[N]], config: Config): DefaultGraphImpl[N, E]

    Definition Classes

    GraphCompanion

14. def finalize(): Unit

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( classOf[java.lang.Throwable] )

15. def from[N, E[X] <: EdgeLikeIn[X]](nodes: Iterable[N], edges: Iterable[E[N]])(implicit edgeT: scala.reflect.api.JavaUniverse.TypeTag[E[N]], config: Config): DefaultGraphImpl[N, E]

    Definition Classes

    DefaultGraphImpl → GraphCompanion

16. def fromStream[N, E[X] <: EdgeLikeIn[X]](nodeStreams: Iterable[NodeInputStream[N]] = Seq.empty[NodeInputStream[N]], iniNodes: Iterable[N] = Seq.empty[N], edgeStreams: Iterable[GenEdgeInputStream[N, E]] = Seq.empty[GenEdgeInputStream[N,E]], iniEdges: Iterable[E[N]] = Seq.empty[E[N]])(implicit edgeT: scala.reflect.api.JavaUniverse.TypeTag[E[N]], config: Config): DefaultGraphImpl[N, E]

    Definition Classes

    DefaultGraphImpl → GraphCompanion

17. def fromUnchecked[N, E[X] <: EdgeLikeIn[X]](nodes: Iterable[N], edges: Iterable[E[N]])(implicit edgeT: scala.reflect.api.JavaUniverse.TypeTag[E[N]], config: Config): DefaultGraphImpl[N, E]

    Same as from except for constraint being suppressed.

    Same as from except for constraint being suppressed.

    Attributes

    protected[scalax.collection]

    Definition Classes

    DefaultGraphImpl → GraphConstrainedCompanion

18. final def getClass(): Class[_]

    Definition Classes

    AnyRef → Any

19. def hashCode(): Int

    Definition Classes

    AnyRef → Any

20. final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

21. final def ne(arg0: AnyRef): Boolean

    Definition Classes

    AnyRef

22. def newBuilder[N, E[X] <: EdgeLikeIn[X]](implicit edgeT: scala.reflect.api.JavaUniverse.TypeTag[E[N]], config: Config): Builder[Param[N, E], DefaultGraphImpl[N, E]]

    Definition Classes

    GraphConstrainedCompanion → GraphCompanion

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( ... )