Package org.graph4j

Class DirectedGraphAlgorithm

java.lang.Object

org.graph4j.DirectedGraphAlgorithm

Direct Known Subclasses:

TarjanStrongConnectivity, TopologicalOrdering, TournamentSupport

public abstract class DirectedGraphAlgorithm
extends Object

Abstract class for algorithms that accept only directed graphs as input.

Author:

Cristian Frăsinaru

Field Summary

Fields

Modifier and Type	Field	Description
protected final Digraph	graph
protected Boolean	stronglyConnected

Constructor Summary

Constructors

Constructor	Description
DirectedGraphAlgorithm(Digraph graph)

Method Summary

Modifier and Type	Method	Description
boolean	isStronglyConnected()	Returns true if the digraph is strongly connected.

Methods inherited from class java.lang.Object

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

Field Details

graph

protected final Digraph graph

stronglyConnected

protected Boolean stronglyConnected

Constructor Details

DirectedGraphAlgorithm

public DirectedGraphAlgorithm(Digraph graph)

Parameters:

graph - the input digraph

Method Details

isStronglyConnected

public boolean isStronglyConnected()

Returns true if the digraph is strongly connected.

Returns:

true if the digraph is strongly connected.