agape.tools

Class Components

java.lang.Object

agape.tools.Components

public class Components
extends java.lang.Object

This class provides methods for connected component computation.

Author:

V. Levorato

Constructor Summary

Constructors

Constructor and Description
Components()

Method Summary

Methods

Modifier and Type	Method and Description
static <V,E> java.util.ArrayList<java.util.Set<V>>	getAllConnectedComponent(edu.uci.ics.jung.graph.Graph<V,E> G) Return all connected components of G.
static <V,E> java.util.ArrayList<java.util.Set<V>>	getAllConnectedComponent(edu.uci.ics.jung.graph.Graph<V,E> G, java.util.Set restrictNodes) Same method as getAllConnectedComponent(Graph G) with a set constraint representing nodes to be excluded.
static <V,E> java.util.ArrayList<java.util.Set<V>>	getAllStronglyConnectedComponent(edu.uci.ics.jung.graph.Graph<V,E> G) Returns ALL strongly connected components in a directed graph (Tarjan's algorithm).
static <V,E> edu.uci.ics.jung.graph.Graph<V,E>	getComplementGraph(edu.uci.ics.jung.graph.Graph<V,E> G, org.apache.commons.collections15.Factory<E> eFactory) Returns a graph which is the complement of G.
static <V,E> java.util.Set<V>	getConnectedComponent(edu.uci.ics.jung.graph.Graph<V,E> G) Return a connected component of G.
static <V,E> java.util.Set<V>	getConnectedComponent(edu.uci.ics.jung.graph.Graph<V,E> G, java.util.Set<V> restrictNodes) Same method as getConnectedComponent(Graph G) with a set constraint representing nodes to be excluded.

Methods inherited from class java.lang.Object

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

Constructor Detail

Components

public Components()

Method Detail

getConnectedComponent

public static <V,E> java.util.Set<V> getConnectedComponent(edu.uci.ics.jung.graph.Graph<V,E> G,
                                           java.util.Set<V> restrictNodes)

Same method as getConnectedComponent(Graph G) with a set constraint representing nodes to be excluded.

Parameters:

G - graph

restrictNodes - nodes to be excluded

Returns:

a connected component

getConnectedComponent

public static <V,E> java.util.Set<V> getConnectedComponent(edu.uci.ics.jung.graph.Graph<V,E> G)

Return a connected component of G.

Parameters:

G - Graph in which component has to be found

Returns:

connected component of G

getAllConnectedComponent

public static <V,E> java.util.ArrayList<java.util.Set<V>> getAllConnectedComponent(edu.uci.ics.jung.graph.Graph<V,E> G,
                                                                   java.util.Set restrictNodes)

Same method as getAllConnectedComponent(Graph G) with a set constraint representing nodes to be excluded.

Parameters:

G - graph

restrictNodes - nodes to be excluded

Returns:

a list of all connected components

getAllConnectedComponent

public static <V,E> java.util.ArrayList<java.util.Set<V>> getAllConnectedComponent(edu.uci.ics.jung.graph.Graph<V,E> G)

Return all connected components of G.

Parameters:

G - Graph in which components have to be found

Returns:

list of all connected components of G.

getAllStronglyConnectedComponent

public static <V,E> java.util.ArrayList<java.util.Set<V>> getAllStronglyConnectedComponent(edu.uci.ics.jung.graph.Graph<V,E> G)

Returns ALL strongly connected components in a directed graph (Tarjan's algorithm).

Parameters:

G - graph

Returns:

a list of all strongly connected components

getComplementGraph

public static <V,E> edu.uci.ics.jung.graph.Graph<V,E> getComplementGraph(edu.uci.ics.jung.graph.Graph<V,E> G,
                                                         org.apache.commons.collections15.Factory<E> eFactory)

Returns a graph which is the complement of G. A factory is needed to create the new edges of the complement graph.

Parameters:

G - graph

eFactory - edge factory

Returns:

complement graph of G.