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. 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

  2. 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

  3. 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

  4. val g_: Graph[TLabel]