izumi.fundamentals.graphs

Members list

Type members

Classlikes

trait AbstractGraph[N, +M]

Attributes

Supertypes
class Object
trait Matchable
class Any
Known subtypes
class DAG[N, M]
class DG[N, M]
class DLG[N, M]
sealed trait AbstractGraphError

Attributes

Supertypes
class Object
trait Matchable
class Any
Known subtypes
trait GraphError[N]
trait DAGError[N]
class UnexpectedLoops[N]
trait ToposortError[N]
class UnexpectedLoop[N]
Show all
object DAG extends GraphSyntax[DAG]

Attributes

Companion
class
Supertypes
trait Product
trait Mirror
trait GraphSyntax[DAG]
class Object
trait Matchable
class Any
Show all
Self type
DAG.type
final case class DAG[N, M] extends AbstractGraph[N, M], DirectedAcyclicGraph[N, M], DirectedGraphSucc[N, M], DirectedGraphPred[N, M]

Attributes

Companion
object
Supertypes
trait Serializable
trait Product
trait Equals
trait DirectedGraphPred[N, M]
trait DirectedGraphSucc[N, M]
trait GraphImpl[N, M]
trait DirectedAcyclicGraph[N, M]
trait DirectedGraph[N, M]
trait GraphProperty[N, M]
trait AbstractGraph[N, M]
class Object
trait Matchable
class Any
Show all
sealed trait DAGError[N] extends GraphError[N]

Attributes

Companion
object
Supertypes
trait GraphError[N]
class Object
trait Matchable
class Any
Known subtypes
object DAGError

Attributes

Companion
trait
Supertypes
trait Sum
trait Mirror
class Object
trait Matchable
class Any
Self type
DAGError.type
object DG extends GraphSyntax[DG]

Attributes

Companion
class
Supertypes
trait Product
trait Mirror
trait GraphSyntax[DG]
class Object
trait Matchable
class Any
Show all
Self type
DG.type
final case class DG[N, M] extends AbstractGraph[N, M], DirectedGraph[N, M], DirectedGraphSucc[N, M], DirectedGraphPred[N, M]

Value parameters

predecessors

Dependencies as values, dependees as keys (e.g. after -> Set(before))

successors

Dependees as values, dependencies as keys (e.g. before -> Set(after)

Attributes

Companion
object
Supertypes
trait Serializable
trait Product
trait Equals
trait DirectedGraphPred[N, M]
trait DirectedGraphSucc[N, M]
trait GraphImpl[N, M]
trait DirectedGraph[N, M]
trait GraphProperty[N, M]
trait AbstractGraph[N, M]
class Object
trait Matchable
class Any
Show all
object DLG

Attributes

Companion
class
Supertypes
trait Product
trait Mirror
class Object
trait Matchable
class Any
Self type
DLG.type
final case class DLG[N, +M](nodes: Seq[N], meta: GraphMeta[N, M]) extends AbstractGraph[N, M], DirectedAcyclicGraph[N, M], DirectedGraphSucc[N, M], DirectedGraphPred[N, M]

Attributes

Companion
object
Supertypes
trait Serializable
trait Product
trait Equals
trait DirectedGraphPred[N, M]
trait DirectedGraphSucc[N, M]
trait GraphImpl[N, M]
trait DirectedAcyclicGraph[N, M]
trait DirectedGraph[N, M]
trait GraphProperty[N, M]
trait AbstractGraph[N, M]
class Object
trait Matchable
class Any
Show all
final case class Edge[N](predecessor: N, successor: N)

Attributes

Supertypes
trait Serializable
trait Product
trait Equals
class Object
trait Matchable
class Any
Show all
sealed trait GraphError[N] extends AbstractGraphError

Attributes

Supertypes
class Object
trait Matchable
class Any
Known subtypes
trait DAGError[N]
class UnexpectedLoops[N]
trait ToposortError[N]
class UnexpectedLoop[N]
Show all
object GraphImpl

Attributes

Companion
trait
Supertypes
class Object
trait Matchable
class Any
Self type
GraphImpl.type
sealed trait GraphImpl[N, +M]

Attributes

Companion
object
Supertypes
class Object
trait Matchable
class Any
Known subtypes
trait DirectedGraphPred[N, M]
class DAG[N, M]
class DG[N, M]
class DLG[N, M]
trait DirectedGraphSucc[N, M]
Self type
final case class GraphMeta[N, +M](nodes: Map[N, M]) extends AnyVal

Attributes

Companion
object
Supertypes
trait Serializable
trait Product
trait Equals
class AnyVal
trait Matchable
class Any
Show all
object GraphMeta

Attributes

Companion
class
Supertypes
class Object
trait Matchable
class Any
Self type
GraphMeta.type
object GraphProperty

Attributes

Companion
trait
Supertypes
class Object
trait Matchable
class Any
Self type
sealed trait GraphProperty[N, +M]

Attributes

Companion
object
Supertypes
class Object
trait Matchable
class Any
Known subtypes
trait DirectedGraph[N, M]
class DG[N, M]
trait DirectedAcyclicGraph[N, M]
class DAG[N, M]
class DLG[N, M]
Self type
trait GraphSyntax[G <: (AbstractGraph)]

Attributes

Supertypes
class Object
trait Matchable
class Any
Known subtypes
object DAG
object DG

Attributes

Companion
trait
Supertypes
trait Sum
trait Mirror
class Object
trait Matchable
class Any
Self type
sealed trait GraphTraversalError[N] extends GraphError[N]

Attributes

Companion
object
Supertypes
trait GraphError[N]
class Object
trait Matchable
class Any
Known subtypes
trait NodeShow[T]

Attributes

Companion
object
Supertypes
class Object
trait Matchable
class Any
object NodeShow

Attributes

Companion
trait
Supertypes
class Object
trait Matchable
class Any
Self type
NodeShow.type
object ToposortError

Attributes

Companion
trait
Supertypes
trait Sum
trait Mirror
class Object
trait Matchable
class Any
Self type
sealed trait ToposortError[N] extends GraphTraversalError[N]

Attributes

Companion
object
Supertypes
trait GraphError[N]
class Object
trait Matchable
class Any
Show all
Known subtypes
class UnexpectedLoop[N]
final case class WeakEdge[N](predecessor: N, successor: N)

Attributes

Supertypes
trait Serializable
trait Product
trait Equals
class Object
trait Matchable
class Any
Show all