sim.field.network.stats
Class ConnectivityStatistics

java.lang.Object
  extended by sim.field.network.stats.ConnectivityStatistics

public class ConnectivityStatistics
extends java.lang.Object


Constructor Summary
ConnectivityStatistics()
           
 
Method Summary
static Bag getConnectedComponents(Network network)
          Computes the connected components of an undirected OR the weakly connected components of an directed graph graph using DFS.
static int getDigraphEdgeConnectivity(Network network)
          Computes the edge connectivity of a digraph (directed graph) (i.e.
static int getEdgeConnectivity(Network network)
          Computes the edge connectivity of a network (i.e.
static int getGraphEdgeConnectivity(Network network)
          Computes the edge connectivity of an undirected graph (i.e.
static int getNodeConnectivity(Network network)
          Computes the node connectivity of a network (i.e.
static Bag getStronglyConnectedComponents(Network network)
          Computes the strongly connected components of an ORIENTED graph.
static boolean isConnected(Network network)
          Determines whether the graph is connected (for undirected graphs) OR weakly connected (for directed graphs)
static boolean isStronglyConnected(Network network)
          Checks if a directed graph is strongly connected.
 
Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
 

Constructor Detail

ConnectivityStatistics

public ConnectivityStatistics()
Method Detail

isStronglyConnected

public static boolean isStronglyConnected(Network network)
Checks if a directed graph is strongly connected.


getStronglyConnectedComponents

public static Bag getStronglyConnectedComponents(Network network)
Computes the strongly connected components of an ORIENTED graph.

Returns:
Bag containing the connected components (each element in the bag is another bag of nodes).

getConnectedComponents

public static Bag getConnectedComponents(Network network)
Computes the connected components of an undirected OR the weakly connected components of an directed graph graph using DFS.

Returns:
A Bag of Bags of nodes.

isConnected

public static boolean isConnected(Network network)
Determines whether the graph is connected (for undirected graphs) OR weakly connected (for directed graphs)


getEdgeConnectivity

public static int getEdgeConnectivity(Network network)
Computes the edge connectivity of a network (i.e. the minimum number of edges that can be removed to make the graph disconnected).


getDigraphEdgeConnectivity

public static int getDigraphEdgeConnectivity(Network network)
Computes the edge connectivity of a digraph (directed graph) (i.e. the minimum number of edges that can be removed to make the graph disconnected). Assumes the digraph is weakly connected and non-trivial.


getGraphEdgeConnectivity

public static int getGraphEdgeConnectivity(Network network)
Computes the edge connectivity of an undirected graph (i.e. the minimum number of edges that can be removed to make the graph disconnected).


getNodeConnectivity

public static int getNodeConnectivity(Network network)
Computes the node connectivity of a network (i.e. the minimum number of nodes that can be removed to make the graph disconnected).