fr.inria.opengve.bridge.algorithms
Enum GraphUtility.Propriety

java.lang.Object
  java.lang.Enum<GraphUtility.Propriety>
      fr.inria.opengve.bridge.algorithms.GraphUtility.Propriety

All Implemented Interfaces:

java.io.Serializable, java.lang.Comparable<GraphUtility.Propriety>

Enclosing class:

GraphUtility

public static enum GraphUtility.Propriety
extends java.lang.Enum<GraphUtility.Propriety>

All possible properties that can be tested.

Author:

fabrice.peix@sophia.inria.fr

Enum Constant Summary

CONNECTED_GRAPH
Connectect property : minimum cut is greater of equal to one.

EMPTY_GRAPH
Empty graph properties : the vertex set size is equal to zero

HAVE_LOOP_LINKS
Have loop property : The graph contains a link having the same vertex has source and destination.

MULTI_GRAPH
Multi graph property : the graph have at least a couple of edges (arcs) connecting the same vertices

STRONGLY_CONNECTED_GRAPH
Strongly connected property : All vertices are reachable from any vertices.

Method Summary

static GraphUtility.Propriety	valueOf(java.lang.String name) Returns the enum constant of this type with the specified name.
static GraphUtility.Propriety[]	values() Returns an array containing the constants of this enum type, in the order they're declared.
protected abstract <V,L extends Link<V>> boolean	verify(Graph<V,L> graph) Verify that a given graph verify this property.

Methods inherited from class java.lang.Enum

clone, compareTo, equals, getDeclaringClass, hashCode, name, ordinal, toString, valueOf

Methods inherited from class java.lang.Object

finalize, getClass, notify, notifyAll, wait, wait, wait

Enum Constant Detail

EMPTY_GRAPH

public static final GraphUtility.Propriety EMPTY_GRAPH

Empty graph properties : the vertex set size is equal to zero

MULTI_GRAPH

public static final GraphUtility.Propriety MULTI_GRAPH

Multi graph property : the graph have at least a couple of edges (arcs) connecting the same vertices

CONNECTED_GRAPH

public static final GraphUtility.Propriety CONNECTED_GRAPH

Connectect property : minimum cut is greater of equal to one.

STRONGLY_CONNECTED_GRAPH

public static final GraphUtility.Propriety STRONGLY_CONNECTED_GRAPH

Strongly connected property : All vertices are reachable from any vertices.

HAVE_LOOP_LINKS

public static final GraphUtility.Propriety HAVE_LOOP_LINKS

Have loop property : The graph contains a link having the same vertex has source and destination.

Method Detail

values

public static final GraphUtility.Propriety[] values()

Returns an array containing the constants of this enum type, in the order they're declared. This method may be used to iterate over the constants as follows:

for(GraphUtility.Propriety c : GraphUtility.Propriety.values())
        System.out.println(c);

Returns:

an array containing the constants of this enum type, in the order they're declared

valueOf

public static GraphUtility.Propriety valueOf(java.lang.String name)

Returns the enum constant of this type with the specified name. The string must match exactly an identifier used to declare an enum constant in this type. (Extraneous whitespace characters are not permitted.)

Parameters:

name - the name of the enum constant to be returned.

Returns:

the enum constant with the specified name

Throws:

java.lang.IllegalArgumentException - if this enum type has no constant with the specified name

verify

protected abstract <V,L extends Link<V>> boolean verify(Graph<V,L> graph)

Verify that a given graph verify this property.

Parameters:

graph - The graph.

Returns:

true if the given graph verify this property and false otherwise.