edu.upc.dama.dex.algorithms
Class WeakConnectivity

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.WeakConnectivity

All Implemented Interfaces:

Algorithm

Direct Known Subclasses:

WeakConnectivityDFS

public abstract class WeakConnectivity
extends Connectivity

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

Author:

Sparsity Technologies

Field Summary

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

NAVIGATION_BACKWARD, NAVIGATION_FORWARD, NAVIGATION_UNDIRECTED

Constructor Summary

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

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

WeakConnectivity

public WeakConnectivity(Graph graph)

Creates a new instance of WeakConnectivity.

Parameters:

graph - Graph on which the algorithm will be run.