edu.upc.dama.dex.algorithms
Class StrongConnectivity

java.lang.Object
  edu.upc.dama.dex.tasks.Task
      edu.upc.dama.dex.tasks.CompositeTask
          edu.upc.dama.dex.algorithms.Connectivity
              edu.upc.dama.dex.algorithms.StrongConnectivity

All Implemented Interfaces:

Algorithm

Direct Known Subclasses:

StrongConnectivityGabow

public abstract class StrongConnectivity
extends Connectivity

Any class implementing this abstract class can be used to solve the problem of finding strongly connected components in a directed graph or in an undirected graph which will be considered as a directed one.

Author:

Sparsity Technologies

Field Summary

Fields inherited from interface edu.upc.dama.dex.algorithms.Algorithm

NAVIGATION_BACKWARD, NAVIGATION_FORWARD, NAVIGATION_UNDIRECTED

Constructor Summary

StrongConnectivity(Graph graph)
Creates a new instance of StrongConnectivity.

Method Summary

Methods inherited from class edu.upc.dama.dex.algorithms.Connectivity

addAllEdges, addAllNodes, addEdge, addNode, close, getConnectedComponents, run, setMaterializedAttribute

Methods inherited from class edu.upc.dama.dex.tasks.CompositeTask

cancel, execute, init

Methods inherited from class edu.upc.dama.dex.tasks.Task

main

Methods inherited from class java.lang.Object

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

Constructor Detail

StrongConnectivity

public StrongConnectivity(Graph graph)

Creates a new instance of StrongConnectivity.

Parameters:

graph - Graph on which the algorithm will be run.