Packages

c

scalation.graph_db

BiconnectedComp

case class BiconnectedComp[TLabel](g_: Graph[TLabel]) extends Product with Serializable

The BiconnectedComp class provides methods for finding the cut points and blocks in undirected graphs. Removal of a cut point will make the graph disconnected. Cut points and blocks are also referred to as articulation points and biconnected components, respectively.

g_

the graph whose cut points/blocks are sought

Linear Supertypes
Serializable, Serializable, Product, Equals, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. BiconnectedComp
  2. Serializable
  3. Serializable
  4. Product
  5. Equals
  6. AnyRef
  7. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new BiconnectedComp(g_: Graph[TLabel])

    g_

    the graph whose cut points/blocks are sought

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  4. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  5. def assembleBlockTree(): Unit

    Assemble the cut points and blocks in undirected graph 'g_' into a block tree.

    Assemble the cut points and blocks in undirected graph 'g_' into a block tree. See Algorithm 7 and Figure 7.b in

    See also

    pluto.huji.ac.il/~galelidan/papers/ElidanGouldJMLR.pdf

  6. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native() @HotSpotIntrinsicCandidate()
  7. def cutPoints(): ArrayBuffer[Int]

    Find all the cut points in undirected graph 'g_'.

    Find all the cut points in undirected graph 'g_'. Translated from Java code. Use when only cut points (not blocks) are sought.

    See also

    algs4.cs.princeton.edu/41graph/Biconnected.java.html

  8. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  9. def findBlocks(): ArrayBuffer[Block]

    Find all the blocks (and cut points) in undirected graph 'g_'.

    Find all the blocks (and cut points) in undirected graph 'g_'. The parent block is also determined. Translated from pseudo-code.

    See also

    www.cs.umd.edu/class/fall2005/cmsc451/biconcomps.pdf

  10. val g_: Graph[TLabel]
  11. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  12. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  13. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  14. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  15. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  16. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  17. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  18. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()
  19. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Deprecated Value Members

  1. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] ) @Deprecated
    Deprecated

Inherited from Serializable

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from AnyRef

Inherited from Any

Ungrouped