This is the recursive step. @param result The set that will be returned @param element the element @return true if there is a valid coloring for the

{@inheritDoc}

TODO Fillme!! @param grapher

Implements the {@code CONSOLIDATE(H)} function. <pre>CONSOLIDATE(H) 1 for i &larr; 0 to D(n[H]) 2 do A[i] &larr; NIL 3 for each node w in the ro

{@inheritDoc}

Tests if the 'vertex' is colored. @param vertex the vertex @return true if the colored vertex is contained into the map, false otherwise

Creates a spanning tree using the current data. @return a spanning tree using current data

Implements the {@code CUT(H,x,y)} function. <pre>CUT(H,x,y) 1 remove x from the child list of y, decrementing degree[y] 2 add x to the root list of

Executes additional actions to edge that will be added @param head the head vertex @param e the edge @param tail the tail vertex

Executes additional actions to vertex that will be added @param v the vertex

Executes additional actions to edge that will be removed @param e the edge

Executes additional actions to vertex that will be removed @param v the vertex

Decreases the degree of current node. @see #getDegree()

Performs operations on the input edge and determines the behavior of the visit algorithm based on the return value: <ul> <li>{@link VisitState.CONTI

Called at the beginning of breadth-first and depth-first search.

Performs operations on the input vertex and determines the behavior of the visit algorithm based on the return value: <ul> <li>{@link VisitState.CON

Ranks the players (vertices) that took part in a tournament (graph) depending on the game results (edges), applying the <a href="https://en.wikipedia.

Returns the shortest path between source and target @param source The source Vertex @param target The target Vertex @return Returns the shortest path

Checks if the search algorithm should be terminated. Called after the search algorithm has finished visiting the input edge. @return {@link VisitStat

Called upon termination of the search algorithm.

{@inheritDoc}

Checks if the search algorithm should be terminated. Called after the search algorithm has finished visiting the input vertex. @return {@link VisitSt

Specifies the shortest path source. @param source

{@inheritDoc}

This method shows when a definition is defined.

{@inheritDoc}

For a vertex, the number of head endpoints adjacent to a node is called the indegree. @param v the vertex which indegree has to be returned. @return

{@inheritDoc}

Returns the edge with the minimum weight to other {@link SuperVertex} instances. @return the minimum weight edge or <code>null</code> if there is no

Returns this node rank. @return this node rank

Returns the source of the path. @return the source of the path.

Description of the Method

Increases the degree of current node. @see #getDegree()

Increases this node rank.

Checks the predecessor list has no elements. @return true, if the predecessor list has no elements, false otherwise.

Returns the current node mark status. @return true, if the node is marked, false otherwise.

Tests if there is some adjacent vertices with the same color. @param currentVertex @return

This method shows when a definition is killed (or overwritten.)

Implements the {@code FIB-HEAP-LINK(H, y, x)} function. <pre>FIB-HEAP-LINK(H, y, x) 1 remove y from the root list of H 2 make y a child of x, incre

Merges another {@link SuperVertex} instance into this one. The edges from the other {@link SuperVertex} are only added in case they are not to vertice

Invoked once the visit is finished. @return Value that will be returned by the visit

Remove the input vertex color. @param v the vertex for which storing the color.

Removes the vertex from the {@code MutableGraph} object. <b>NOTE</b>: implementors have to take in consideration throwing a {@link GraphException} if

Sets the reference to the parent node. @param parent the reference to the parent node

Specifies the shortest path source. @param target

Join two subsets into a single subset, performing the merge by applying the <i>union by rank</i>. @param e1 the first element which related subset ha

Update the ranking for the player @param player the player @param ranking the ranking value

Export Graphs in <a href="https://en.wikipedia.org/wiki/DOT_language">DOT language</a>. @return {@link DotExporter} instance @throws GraphExportExcep

TODO Fill me!!! @param playersRank @return

TODO Fill me!!

Constructor for the AcyclicContract object

Constructor for the AcyclicContractTest object @param name

Constructor visible only inside the package

This class can be instantiated only inside the package

Hidden constructor, this class cannot be instantiated.

Constructor for the CycleDetector object @param graph

Constructor for the DAGTest object @param name

Creates a new instance of {@link DefaultColorsBuilder} for the input graph. @param graph the graph

Create a new instance of {@link DefaultConnectivityAlgorithmsSelector} calculated for a set of included vertices @param graph the graph @param includ

Creates a nw instance of {@link DefaultConnectivityBuilder} @param graph the graph

Creates a new instance of export selector for the given graph @param graph the graph

Creates a new instance of flow weighted edges builder for the given graph @param graph the graph