object
GraphPredef
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
-
-
-
-
implicit
def
any2EdgeAssoc[N1](n: N1): EdgeAssoc[N1]
-
implicit
def
anyToNode[N](n: N): NodeIn[N]
-
final
def
asInstanceOf[T0]: T0
-
def
clone(): AnyRef
-
implicit
def
edge2HyperEdgeAssoc[NOld](e: EdgeLikeIn[NOld]): HyperEdgeAssoc[NOld]
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(arg0: Any): Boolean
-
def
finalize(): Unit
-
final
def
getClass(): Class[_]
-
implicit
def
graphParamsToPartition[N, E[X] <: EdgeLikeIn[X]](elems: Iterable[GraphParam[N, E]]): Partitions[N, E]
-
def
hashCode(): Int
-
final
def
isInstanceOf[T0]: Boolean
-
final
def
ne(arg0: AnyRef): Boolean
-
def
nodePredicate[NI, EI[X <: NI] <: EdgeLike[X], NO <: NodeOut[NI], EO[X <: NO] <: EdgeLike[X]](pred: (NI) ⇒ Boolean): (GraphParam[NI, EI]) ⇒ Boolean
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
implicit
def
predicateToNodePredicate[NI, EI[X <: NI] <: EdgeLike[X], NO <: NodeOut[NI], EC[X <: NO] <: EdgeLike[X]](p: (NI) ⇒ Boolean): (GraphParam[NI, EI]) ⇒ Boolean
-
implicit
def
seqToGraphParam[N, E[X <: N] <: EdgeLikeIn[X]](s: Seq[N]): Seq[GraphParamIn[N, E]]
-
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 AnyRef
Inherited from Any
This object serves as a container for several
Graph
-related definitions like parameter-types and implicit conversions.You will usually simply import all its members along with the members of
EdgeOut
:import scalax.collection.GraphPredef._, scalax.collection.EdgeOut._