Class TarjansBiConnected<T>
Finds if a graph is BiConnected.
Inherited Members
Namespace: Advanced.Algorithms.Graph
Assembly: Advanced.Algorithms.dll
Syntax
public class TarjansBiConnected<T>
Type Parameters
| Name | Description |
|---|---|
| T |
Methods
IsBiConnected(IGraph<T>)
This is using ariticulation alogrithm based on the observation that a graph is BiConnected if and only if there is no articulation Points.
Declaration
public bool IsBiConnected(IGraph<T> graph)
Parameters
| Type | Name | Description |
|---|---|---|
| IGraph<T> | graph |
Returns
| Type | Description |
|---|---|
| Boolean |