Value Members
-
final
def
!=(arg0: AnyRef): Boolean
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: AnyRef): Boolean
-
final
def
==(arg0: Any): Boolean
-
def
apply[N](elems: InParam[N, UnDiEdge]*)(implicit edgeT: scala.reflect.api.JavaUniverse.TypeTag[UnDiEdge[N]], config: GraphConfig): constrained.Graph[N, UnDiEdge]
-
final
def
asInstanceOf[T0]: T0
-
def
clone(): AnyRef
-
def
empty[N](implicit edgeT: scala.reflect.api.JavaUniverse.TypeTag[UnDiEdge[N]], config: GraphConfig): constrained.Graph[N, UnDiEdge]
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(arg0: Any): Boolean
-
def
finalize(): Unit
-
def
from[N](nodes: Iterable[N], edges: Iterable[UnDiEdge[N]])(implicit edgeT: scala.reflect.api.JavaUniverse.TypeTag[UnDiEdge[N]], config: GraphConfig): constrained.Graph[N, UnDiEdge]
-
def
fromStream[N](nodeStreams: Iterable[NodeInputStream[N]] = Seq.empty[NodeInputStream[N]], nodes: Iterable[N] = Seq.empty[N], edgeStreams: Iterable[GenEdgeInputStream[N, UnDiEdge]] = Seq.empty[GenEdgeInputStream[N,E]], edges: Iterable[UnDiEdge[N]] = Seq.empty[E[N]])(implicit edgeT: scala.reflect.api.JavaUniverse.TypeTag[UnDiEdge[N]], config: GraphConfig): constrained.Graph[N, UnDiEdge]
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
final
def
isInstanceOf[T0]: Boolean
-
final
def
ne(arg0: AnyRef): Boolean
-
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 AnyRef
Inherited from Any
Companion module for mutable undirected acyclic
Graph
.