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
- Alphabetic
- By Inheritance
- BiconnectedComp
- Serializable
- Serializable
- Product
- Equals
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Instance Constructors
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
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
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
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
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
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
- val g_: Graph[TLabel]
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )