Packages

c

scalax.collection.GraphTraversal

TopologicalSortFailure

case class TopologicalSortFailure extends Product with Serializable

Failure result of a topological sort with a possible hint of candidate cycle nodes.

Linear Supertypes
Type Hierarchy
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. TopologicalSortFailure
  2. Serializable
  3. Product
  4. Equals
  5. AnyRef
  6. Any
Implicitly
  1. by ChainingOps
  2. by EdgeAssoc
  3. by anyToNode
  4. by any2stringadd
  5. by StringFormat
  6. by Ensuring
  7. by ArrowAssoc
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Value Members

  1. val candidateCycleNodes: Set[NodeT]
  2. def cycle: Option[Cycle]

    Finds a cycle based on candidateCycleNodes.

    Finds a cycle based on candidateCycleNodes. Should always return Some. None would indicate an internal issue related to the preceding topological sort.

  3. def isDefined: Boolean
    Implicit
    This member is added by an implicit conversion from TopologicalSortFailure toOuterNode[TopologicalSortFailure] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    Param
  4. final def isEdge: Boolean
    Implicit
    This member is added by an implicit conversion from TopologicalSortFailure toOuterNode[TopologicalSortFailure] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    Param
  5. def isIn: Boolean
    Implicit
    This member is added by an implicit conversion from TopologicalSortFailure toOuterNode[TopologicalSortFailure] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    InParamParam
  6. def isNode: Boolean
    Implicit
    This member is added by an implicit conversion from TopologicalSortFailure toOuterNode[TopologicalSortFailure] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    NodeParam
  7. final def isOut: Boolean
    Implicit
    This member is added by an implicit conversion from TopologicalSortFailure toOuterNode[TopologicalSortFailure] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    Param
  8. val n1: TopologicalSortFailure
    Implicit
    This member is added by an implicit conversion from TopologicalSortFailure toEdgeAssoc[TopologicalSortFailure] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
  9. def pipe[B](f: (TopologicalSortFailure) => B): B
    Implicit
    This member is added by an implicit conversion from TopologicalSortFailure toChainingOps[TopologicalSortFailure] performed by method ChainingOps in scalax.collection.
    Definition Classes
    ChainingOps
  10. def productElementNames: Iterator[String]
    Definition Classes
    Product
  11. val self: TopologicalSortFailure
    Implicit
    This member is added by an implicit conversion from TopologicalSortFailure toChainingOps[TopologicalSortFailure] performed by method ChainingOps in scalax.collection.
    Definition Classes
    ChainingOps
  12. def stringPrefix: String
    Implicit
    This member is added by an implicit conversion from TopologicalSortFailure toOuterNode[TopologicalSortFailure] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    NodeParam
  13. def tap[U](f: (TopologicalSortFailure) => U): TopologicalSortFailure
    Implicit
    This member is added by an implicit conversion from TopologicalSortFailure toChainingOps[TopologicalSortFailure] performed by method ChainingOps in scalax.collection.
    Definition Classes
    ChainingOps
  14. def toString(): String
    Implicit
    This member is added by an implicit conversion from TopologicalSortFailure toOuterNode[TopologicalSortFailure] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    NodeParam → AnyRef → Any
  15. val value: TopologicalSortFailure
    Implicit
    This member is added by an implicit conversion from TopologicalSortFailure toOuterNode[TopologicalSortFailure] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    OuterNodeNodeParam
  16. def ~[N >: N1](n2: N): UnDiEdge[N]
    Implicit
    This member is added by an implicit conversion from TopologicalSortFailure toEdgeAssoc[TopologicalSortFailure] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()
  17. def ~>[N >: N1](n2: N): DiEdge[N]
    Implicit
    This member is added by an implicit conversion from TopologicalSortFailure toEdgeAssoc[TopologicalSortFailure] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()

Shadowed Implicit Value Members

  1. def productElementNames: Iterator[String]
    Implicit
    This member is added by an implicit conversion from TopologicalSortFailure toOuterNode[TopologicalSortFailure] performed by method anyToNode in scalax.collection.GraphPredef.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (topologicalSortFailure: OuterNode[TopologicalSortFailure]).productElementNames
    Definition Classes
    Product