org.chocosolver.util.graphOperations.connectivity

Class ConnectivityFinder

java.lang.Object

org.chocosolver.util.graphOperations.connectivity.ConnectivityFinder

public class ConnectivityFinder
extends Object

Class containing algorithms to find all connected components and articulation points of graph by performing one dfs it uses Tarjan algorithm in a non recursive way and can be performed in O(M+N) time c.f. Gondrand Minoux

Author:

Jean-Guillaume Fages

Field Summary

Fields

Modifier and Type	Field and Description
gnu.trove.list.array.TIntArrayList	isthmusFrom
gnu.trove.list.array.TIntArrayList	isthmusTo

Constructor Summary

Constructors

Constructor and Description
ConnectivityFinder(IGraph g) Create an object that can compute Connected Components (CC) of a graph g Can also quickly tell whether g is biconnected or not (only for undirected graph)

Method Summary

Methods

Modifier and Type	Method and Description
void	findAllCC() Find all connected components of graph by performing one dfs Complexity : O(M+N) light and fast in practice
int[]	getCC_firstNode()
int[]	getCC_nextNode()
int	getNBCC() get the number of CC in g Beware you should call method findAllCC() first
int[]	getNode_CC()
boolean	isBiconnected() Test biconnectivity (i.e. connected with no articulation point and no bridge) only for undirected graphs
boolean	isConnectedAndFindIsthma() Only for undirected graphs

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Field Detail

isthmusFrom

public gnu.trove.list.array.TIntArrayList isthmusFrom

isthmusTo

public gnu.trove.list.array.TIntArrayList isthmusTo

Constructor Detail

ConnectivityFinder

public ConnectivityFinder(IGraph g)

Create an object that can compute Connected Components (CC) of a graph g Can also quickly tell whether g is biconnected or not (only for undirected graph)

Parameters:

g - graph

Method Detail

getNBCC

public int getNBCC()

get the number of CC in g Beware you should call method findAllCC() first

Returns:

nbCC the number of CC in g

getCC_firstNode

public int[] getCC_firstNode()

getCC_nextNode

public int[] getCC_nextNode()

getNode_CC

public int[] getNode_CC()

findAllCC

public void findAllCC()

Find all connected components of graph by performing one dfs Complexity : O(M+N) light and fast in practice

isBiconnected

public boolean isBiconnected()

Test biconnectivity (i.e. connected with no articulation point and no bridge) only for undirected graphs

Returns:

true iff g is biconnected

isConnectedAndFindIsthma

public boolean isConnectedAndFindIsthma()

Only for undirected graphs