|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectde.fhstralsund.vinets.algorithm.ConnectivityCheck
public class ConnectivityCheck
Checks graph connectivity. Firstly, it is checked whether the graph is connected. Then, every connected component discovered is checked for biconnectivity. Thus the whole graph is biconnected if both tests result true.
Constructor Summary | |
---|---|
ConnectivityCheck()
Creates a new ConnectivityCheck. |
Method Summary | |
---|---|
boolean |
accept(Parameter params)
Checks whether the passed Parameter is appropriate as input for this Algorithm. |
java.util.Iterator |
cutVertices()
Returns an Iterator over the cut vertices that have been discovered if not all connected components are biconnected. |
Parameter |
execute(Parameter params)
Examines the Graph passed within the Parameter object. |
java.lang.String |
getHint()
Delivers a short help text explaining the features of this Algorithm. |
java.lang.String |
getName()
Delivers a text for the button linked to this Algorithm. |
boolean |
isBiConnected()
Returns whether the connected components of the graph are biconnected. |
boolean |
isConnected()
Returns whether the graph is connected. |
Methods inherited from class java.lang.Object |
---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Constructor Detail |
---|
public ConnectivityCheck()
Method Detail |
---|
public boolean accept(Parameter params)
Algorithm
false
is returned,
the Parameter message should be set to a String describing the
cause for the failing.
accept
in interface Algorithm
params
- a Parameter object containing the input Graph and
possible additional input values.
public java.lang.String getHint()
Algorithm
getHint
in interface Algorithm
public java.lang.String getName()
Algorithm
getName
in interface Algorithm
public Parameter execute(Parameter params)
Algorithm
execute
in interface Algorithm
params
- a Parameter encapsulating a Graph and (optionally) a
String and additional properties.
Parameter
public boolean isConnected()
public boolean isBiConnected()
isConnected
public java.util.Iterator cutVertices()
|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |