Creates a new {@link DefaultLinkedConnectionBuilder} for the graph. @param graph the graph

Creates a new instance of {@link DefaultRankingSelector} for gived graph. @param tournamentGraph the graph

Create a default {@link SccAlgorithmSelector} for the given {@link org.apache.commons.graph.Graph}. @param graph the {@link org.apache.commons.graph.

Creates a default {@link SpanningTreeAlgorithmSelector} for the given {@link Graph} and start vertex. @param graph the {@link Graph} to be used. @par

Create a default {@link VisitAlgorithmsSelector} for the given {@link Graph} and start vertex. @param graph the {@link Graph} to be used. @param sour

Constructor for the DependencyTest object @param name

Creates a new {@link DisjointSet} node with the given value. @param element the node value has to be stored.

Creates a {@link FibonacciHeap} that orders its elements according to their natural ordering.

Build a new {@link FibonacciHeap} node with the given value. @param element the node value has to be stored.

Constructs a new graph exception.

Constructs a new graph export exception with the specified detail message. @param cause the cause @param messagePattern A <a href="../util/Formatter

This class can't be instantiated

Creates a new instance of {@link InMemoryPath} from {@code start} vertex to {@code taget} vertex @param start the start vertex. @param target the tar

Creates a new instance of {@link InMemoryWeightedPath}. @param start the start vertex @param target the target vertex @param weightOperations @param

Create a new {@link KosarajuSharirAlgorithm} instance for the given {@link org.apache.commons.graph.Graph}. @param graph the {@link org.apache.common

Creates a new instance of {@link MutableSpanningTree} @param weightOperations @param weightedEdges

Creates new instance of {@link NotEnoughColorsException}. @param colors the set of color.

Hidden constructor, this class must not be instantiated.

Build a new DirectedGraph mirror. @param directedGraph the DirectedGraph has to be adapted

Create a new {@link SuperVertex} instance with <code>source</code> as start vertex. @param source the start vertex @param graph the underlying graph

Creates a new thread-safe instence of {@link SynchronizedDirectedGraph}. @param g The {@link Graph} that has to be synchronized

Creates a new thread-safe instence of {@link SynchronizedGraph}. @param g The {@link Graph} that has to be synchronized

Creates a new thread-safe instence of {@link SynchronizedMutableGraph}. @param g The {@link Graph} that has to be synchronized

Creates a new thread-safe instence of {@link SynchronizedUndirectedGraph}. @param g The {@link Graph} that has to be synchronized

Constructor for the Task object @param name

Initializes a new vertex pair. @param head the head Vertex @param tail the tail Vertex

Adds the edge in head. @param head the head vertex @param edge the edge @param tail the tail vertex

Adds the edge in tail. @param head the head vertex @param edge the edge @param tail the tail vertex

{@inheritDoc}

{@inheritDoc}

Adds a new edge to graph connector. @param <A> The Graph edges type @param arc the edge to add. @return the {@link HeadVertexConnector}

Adds a feature to the Vertex attribute of the AcyclicContract object

{@inheritDoc}

{@inheritDoc}

Adds a new vertex to graph connector. @param <N> The Graph vertex type @param node the vertex to add @return the vertex added

{@inheritDoc}

{@inheritDoc}

{@inheritDoc}

{@inheritDoc}

{@inheritDoc}

{@inheritDoc}

{@inheritDoc}

{@inheritDoc}

{@inheritDoc}

{@inheritDoc}

{@inheritDoc}

{@inheritDoc}

{@inheritDoc}

{@inheritDoc}

{@inheritDoc}

{@inheritDoc}

{@inheritDoc}

{@inheritDoc}

{@inheritDoc}

{@inheritDoc}

{@inheritDoc}

{@inheritDoc}

{@inheritDoc}

{@inheritDoc}

{@inheritDoc}

Implements the {@code CASCADING-CUT(H,y)} function. <pre>CASCADING-CUT(H,y) 1 z &larr; p[y] 2 if z &ne; NIL 3 then if mark[y] = FALSE 4

{@inheritDoc}

{@inheritDoc}

{@inheritDoc}

{@inheritDoc}

{@inheritDoc}

{@inheritDoc}