Class/Object

scalax.collection.connectivity

GraphComponents

Related Docs: object GraphComponents | package connectivity

Permalink

final class GraphComponents[N, E[X] <: EdgeLikeIn[X]] extends Logging

Provides algorithms for finding graph components.

Linear Supertypes
Logging, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. GraphComponents
  2. Logging
  3. AnyRef
  4. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new GraphComponents(g: Graph[N, E])(implicit edgeT: ClassTag[N])

    Permalink

Type Members

  1. type DeepSearchStackAggregator = (Seq[Graph.NodeT]) ⇒ Unit

    Permalink

Value Members

  1. final def !=(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  3. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  4. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

  5. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  6. def debug(msg: ⇒ String, o: Any, os: Any*): Unit

    Permalink
    Definition Classes
    Logging

  7. def debug(msg: ⇒ String, e: Throwable): Unit

    Permalink
    Definition Classes
    Logging

  8. def debug(msg: ⇒ String): Unit

    Permalink
    Definition Classes
    Logging

  9. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef

  10. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  11. def error(msg: ⇒ String, o: Any, os: Any*): Unit

    Permalink
    Definition Classes
    Logging

  12. def error(msg: ⇒ String, e: Throwable): Unit

    Permalink
    Definition Classes
    Logging

  13. def error(msg: ⇒ String): Unit

    Permalink
    Definition Classes
    Logging

  14. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )

  15. val g: Graph[N, E]

    Permalink

  16. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any

  17. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  18. def info(msg: ⇒ String, o: Any, os: Any*): Unit

    Permalink
    Definition Classes
    Logging

  19. def info(msg: ⇒ String, e: Throwable): Unit

    Permalink
    Definition Classes
    Logging

  20. def info(msg: ⇒ String): Unit

    Permalink
    Definition Classes
    Logging

  21. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

  22. def log: Logger

    Permalink
    Attributes
    protected
    Definition Classes
    Logging

  23. def logName: String

    Permalink
    Attributes
    protected
    Definition Classes
    Logging

  24. var log_: Logger

    Permalink
    Definition Classes
    Logging

  25. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef

  26. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  27. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

  28. def stronglyConnectedComponentsDag: Graph[Graph[N, DiEdge], DiEdge]

    Permalink

    Do Tarjan's algorithm and return the DAG of (cyclic) subgraphs TODO not sound wrt to HyperGraphs

  29. def stronglyConnectedComponentsDag2: Graph[Graph[N, LDiEdge], DiEdge]

    Permalink

    Do Tarjan's algorithm and return the DAG of (cyclic) subgraphs TODO not sound wrt to HyperGraphs

  30. def stronglyConnectedNodeSets: Set[Set[Graph.NodeT]]

    Permalink

    Do Tarjan's algorithm and return the set of node sets

    Do Tarjan's algorithm and return the set of node sets

    returns

    Sets of outer nodes

  31. def stronglyConnectedSets: Set[Set[N]]

    Permalink

    Do Tarjan's algorithm and return the set of sets

    Do Tarjan's algorithm and return the set of sets

    returns

    Sets of inner nodes

  32. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef

  33. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any

  34. def trace(msg: ⇒ String, o: Any, os: Any*): Unit

    Permalink
    Definition Classes
    Logging

  35. def trace(msg: ⇒ String, e: Throwable): Unit

    Permalink
    Definition Classes
    Logging

  36. def trace(msg: ⇒ String): Unit

    Permalink
    Definition Classes
    Logging

  37. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  38. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  39. final def wait(arg0: Long): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  40. def warn(msg: ⇒ String, o: Any, os: Any*): Unit

    Permalink
    Definition Classes
    Logging

  41. def warn(msg: ⇒ String, e: Throwable): Unit

    Permalink
    Definition Classes
    Logging

  42. def warn(msg: ⇒ String): Unit

    Permalink
    Definition Classes
    Logging

Inherited from Logging

Inherited from AnyRef

Inherited from Any

Ungrouped