GraphPredef

object GraphPredef

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 InnerEdgeParam:

import scalax.collection.GraphPredef._, scalax.collection.InnerEdgeParam._

Linear Supertypes

AnyRef, Any

Content Hierarchy

Ordering

Alphabetic
By Inheritance

Inherited

GraphPredef
AnyRef
Any

Hide All
Show All

Visibility

Public
Protected

Type Members

type DiEdgeLikeIn[+N] = DiEdgeLike[N] with EdgeCopy[DiEdgeLike] with OuterEdge[N, DiEdgeLike]
Denotes all directed edge types for the E type parameter of a Graph.
Denotes all directed edge types for the E type parameter of a Graph. Supplying this type as the actual type parameter allows to include any kind of directed edges such as directed hyper-edges and directed edges.
type DiHyperEdgeLikeIn[+N] = DiHyperEdgeLike[N] with EdgeCopy[DiHyperEdgeLike] with OuterEdge[N, DiHyperEdgeLike]
Denotes all directed edge types for the E type parameter of a Graph.
Denotes all directed edge types for the E type parameter of a Graph. Supplying this type as the actual type parameter allows to include any kind of directed edges such as directed hyper-edges and directed edges.
implicit final class EdgeAssoc[N1] extends AnyVal
type EdgeLikeIn[+N] = EdgeLike[N] with EdgeCopy[EdgeLike] with OuterEdge[N, EdgeLike]
The most generic type for the E type parameter of a Graph.
The most generic type for the E type parameter of a Graph. Supplying this type as the actual type parameter allows to include any kind of edges such as hyper-edges, undirected and directed edges.
sealed trait EdgeParam extends AnyRef
implicit final class HyperEdgeAssoc[NOld] extends AnyVal
sealed trait InParam[+N, +E[+X] <: EdgeLike[X]] extends Param[N, E]
N
the type of the nodes (vertices) this graph is passed to by the user.
E
the kind of the edges (links) this graph is passed to by the user.
trait InnerEdgeParam[NI, EI[+X] <: EdgeLike[X], +NO <: InnerNodeParam[NI], EO[+X] <: EdgeLike[X]] extends OutParam[NI, EI] with EdgeParam
NI
the type of the nodes the graph is passed to.
EI
the kind of the edges the graph is passed to.
NO
the type of the nodes created internally.
EO
the kind of the edges created internally.
trait InnerNodeParam[NI] extends OutParam[NI, Nothing] with NodeParam[NI]
NI
the type of the nodes (vertices) this graph is passed to by the user.
trait NodeParam[+N] extends AnyRef
sealed trait OutParam[+NO, +EO[+X] <: EdgeLike[X]] extends Param[NO, EO]
trait OuterEdge[+NI, +EI[+X] <: EdgeLike[X]] extends InParam[NI, EI] with EdgeParam
Classes implementing EdgeLike must be instantiated mixing in this trait.
Classes implementing EdgeLike must be instantiated mixing in this trait. This is a precondition for passing edge-instances to a Graph.
NI
the type of the nodes (vertices) this graph is passed to by the user.
EI
the kind of the edges (links) this graph is passed to by the user.
type OuterElem[N, +E[+X] <: EdgeLike[X]] = InParam[N, E]
Same as InParam.
case class OuterNode[NI](value: NI) extends InParam[NI, Nothing] with NodeParam[NI] with Product with Serializable
NI
the type of the nodes (vertices) this graph is passed to by the user.
sealed trait Param[+N, +E[+X] <: EdgeLike[X]] extends AnyRef
This algebraic type includes outer and inner nodes and edges.
This algebraic type includes outer and inner nodes and edges. As such it serves as the type parameter to SetLike extending Graph.
implicit final class TraversableEnrichments[N, T[X] <: Iterable[X]] extends AnyVal

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
implicit def anyToNode[N](n: N): OuterNode[N]
Annotations
@inline()
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()
implicit def edgeSetToOuter[N, E[+X] <: EdgeLikeIn[X]](edges: Graph.EdgeSetT): Iterable[E[N]]
implicit def edgeSetToSeq[N, E[+X] <: EdgeLikeIn[X]](edges: Graph.EdgeSetT): Seq[OutParam[N, E]]
final def eq(arg0: AnyRef): Boolean
Definition Classes
AnyRef
def equals(arg0: AnyRef): Boolean
Definition Classes
AnyRef → Any
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 nodePredicate[NI, EI[+X] <: EdgeLike[X], NO <: InnerNodeParam[NI], EO[+X] <: EdgeLike[X]](pred: (NI) => Boolean): (Param[NI, EI]) => Boolean
implicit def nodeSetToOuter[N, E[+X] <: EdgeLikeIn[X]](nodes: Graph.NodeSetT): Iterable[N]
implicit def nodeSetToSeq[N, E[+X] <: EdgeLikeIn[X]](nodes: Graph.NodeSetT): Seq[OutParam[N, E]]
final def notify(): Unit
Definition Classes
AnyRef
Annotations
@native() @HotSpotIntrinsicCandidate()
final def notifyAll(): Unit
Definition Classes
AnyRef
Annotations
@native() @HotSpotIntrinsicCandidate()
implicit def predicateToNodePredicate[NI, EI[+X] <: EdgeLike[X], NO <: InnerNodeParam[NI], EC[+X] <: EdgeLike[X]](p: (NI) => Boolean): (Param[NI, EI]) => Boolean
Annotations
@inline()
implicit def seqToGraphParam[N, E[+X] <: EdgeLike[X]](s: Seq[N]): Seq[Param[N, E]]
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])
object InnerEdgeParam
object InnerNodeParam
object Param

Ungrouped

type DiEdgeLikeIn[+N] = DiEdgeLike[N] with EdgeCopy[DiEdgeLike] with OuterEdge[N, DiEdgeLike]
Denotes all directed edge types for the E type parameter of a Graph.
Denotes all directed edge types for the E type parameter of a Graph. Supplying this type as the actual type parameter allows to include any kind of directed edges such as directed hyper-edges and directed edges.
type DiHyperEdgeLikeIn[+N] = DiHyperEdgeLike[N] with EdgeCopy[DiHyperEdgeLike] with OuterEdge[N, DiHyperEdgeLike]
Denotes all directed edge types for the E type parameter of a Graph.
Denotes all directed edge types for the E type parameter of a Graph. Supplying this type as the actual type parameter allows to include any kind of directed edges such as directed hyper-edges and directed edges.
implicit final class EdgeAssoc[N1] extends AnyVal
type EdgeLikeIn[+N] = EdgeLike[N] with EdgeCopy[EdgeLike] with OuterEdge[N, EdgeLike]
The most generic type for the E type parameter of a Graph.
The most generic type for the E type parameter of a Graph. Supplying this type as the actual type parameter allows to include any kind of edges such as hyper-edges, undirected and directed edges.
sealed trait EdgeParam extends AnyRef
implicit final class HyperEdgeAssoc[NOld] extends AnyVal
sealed trait InParam[+N, +E[+X] <: EdgeLike[X]] extends Param[N, E]
N
the type of the nodes (vertices) this graph is passed to by the user.
E
the kind of the edges (links) this graph is passed to by the user.
trait InnerEdgeParam[NI, EI[+X] <: EdgeLike[X], +NO <: InnerNodeParam[NI], EO[+X] <: EdgeLike[X]] extends OutParam[NI, EI] with EdgeParam
NI
the type of the nodes the graph is passed to.
EI
the kind of the edges the graph is passed to.
NO
the type of the nodes created internally.
EO
the kind of the edges created internally.
trait InnerNodeParam[NI] extends OutParam[NI, Nothing] with NodeParam[NI]
NI
the type of the nodes (vertices) this graph is passed to by the user.
trait NodeParam[+N] extends AnyRef
sealed trait OutParam[+NO, +EO[+X] <: EdgeLike[X]] extends Param[NO, EO]
trait OuterEdge[+NI, +EI[+X] <: EdgeLike[X]] extends InParam[NI, EI] with EdgeParam
Classes implementing EdgeLike must be instantiated mixing in this trait.
Classes implementing EdgeLike must be instantiated mixing in this trait. This is a precondition for passing edge-instances to a Graph.
NI
the type of the nodes (vertices) this graph is passed to by the user.
EI
the kind of the edges (links) this graph is passed to by the user.
type OuterElem[N, +E[+X] <: EdgeLike[X]] = InParam[N, E]
Same as InParam.
case class OuterNode[NI](value: NI) extends InParam[NI, Nothing] with NodeParam[NI] with Product with Serializable
NI
the type of the nodes (vertices) this graph is passed to by the user.
sealed trait Param[+N, +E[+X] <: EdgeLike[X]] extends AnyRef
This algebraic type includes outer and inner nodes and edges.
This algebraic type includes outer and inner nodes and edges. As such it serves as the type parameter to SetLike extending Graph.
implicit final class TraversableEnrichments[N, T[X] <: Iterable[X]] extends AnyVal

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
implicit def anyToNode[N](n: N): OuterNode[N]
Annotations
@inline()
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()
implicit def edgeSetToOuter[N, E[+X] <: EdgeLikeIn[X]](edges: Graph.EdgeSetT): Iterable[E[N]]
implicit def edgeSetToSeq[N, E[+X] <: EdgeLikeIn[X]](edges: Graph.EdgeSetT): Seq[OutParam[N, E]]
final def eq(arg0: AnyRef): Boolean
Definition Classes
AnyRef
def equals(arg0: AnyRef): Boolean
Definition Classes
AnyRef → Any
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 nodePredicate[NI, EI[+X] <: EdgeLike[X], NO <: InnerNodeParam[NI], EO[+X] <: EdgeLike[X]](pred: (NI) => Boolean): (Param[NI, EI]) => Boolean
implicit def nodeSetToOuter[N, E[+X] <: EdgeLikeIn[X]](nodes: Graph.NodeSetT): Iterable[N]
implicit def nodeSetToSeq[N, E[+X] <: EdgeLikeIn[X]](nodes: Graph.NodeSetT): Seq[OutParam[N, E]]
final def notify(): Unit
Definition Classes
AnyRef
Annotations
@native() @HotSpotIntrinsicCandidate()
final def notifyAll(): Unit
Definition Classes
AnyRef
Annotations
@native() @HotSpotIntrinsicCandidate()
implicit def predicateToNodePredicate[NI, EI[+X] <: EdgeLike[X], NO <: InnerNodeParam[NI], EC[+X] <: EdgeLike[X]](p: (NI) => Boolean): (Param[NI, EI]) => Boolean
Annotations
@inline()
implicit def seqToGraphParam[N, E[+X] <: EdgeLike[X]](s: Seq[N]): Seq[Param[N, E]]
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])
object InnerEdgeParam
object InnerNodeParam
object Param
def finalize(): Unit
Attributes
protected[lang]
Definition Classes
AnyRef
Annotations
@throws(classOf[java.lang.Throwable]) @Deprecated
Deprecated

Packages

GraphPredef

object GraphPredef

Type Members

Value Members

Deprecated Value Members

Inherited from AnyRef

Value Members

Inherited from Any

Value Members

Ungrouped

Packages

GraphPredef

object GraphPredef

Type Members

Value Members

Deprecated Value Members

Inherited from AnyRef

Value Members

Inherited from Any

Value Members

Ungrouped

GraphPredef