Adds a feature to the vertex attribute of the {@code MutableGraph} object. <b>NOTE</b>: implementors have to take in consideration throwing a {@link

Adds a feature to the edge attribute of the {@code MutableGraph} object <b>NOTE</b>: implementors have to take in consideration throwing a {@link Gra

TODO Fill me !!! @param head @return

TODO Fill me!!! @param tail @return

{@inheritDoc} <pre>FIB-HEAP-INSERT(H, x) 1 degree[x] &larr; 0 2 p[x] &larr; NIL 3 child[x] &larr; NIL 4 left[x] &larr; x 5 right[x] &larr; x 6

Returns the total set of Vertices in the graph. <b>NOTE</b>: implementors have to take in consideration throwing a {@link GraphException} if an error

TODO Fill me!! @param weightedEdges @return

Ensures that an object reference passed as a parameter to the calling method is not null. @param reference an object reference @param <T> The referen

{@inheritDoc}

Find the sortest on the input {@link Graph} @param <V> The Graph vertices type @param <WE> the Graph edges type @param <G> The Graph type @param grap

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

Find the minimum spanning tree on the input {@link Graph} @param <V> The Graph vertices type @param <WE> the Graph edges type @param <G> The Graph ty

Returns the result of the associative binary operation defined by this {@link Semigroup} between two elements of appropriate type. @param e1 the firs

{@inheritDoc}

Returns the edge with vertex source and target. <b>NOTE</b>: implementors have to take in consideration throwing a {@link GraphException} if an error

{@inheritDoc}

Adds a feature to the Edge attribute of the AcyclicContract object

@return the source

@return the target

Calculates the input graph Strongly Connected Component. @param <V> The Graph vertices type. @param <E> The Graph edges type. @param <G> The directed

{@inheritDoc}

Create a color builder. @param <V> The Graph vertices type @param <E> The Graph edges type @param <G> The Graph type @param graph the input graph @re

Specifies the set of colors for coloring the graph. @param <C> The Color type. @param colors the set of colors for coloring the graph. @return the co

{@inheritDoc}

Returns the distance related to input vertex, or null if it wasn't previously visited. <b>NOTE</b>: the method {@link alreadyVisited} should be used

TODO Fill the java doc @param input @return

Creates a new {@link DirectedMutableGraph} instance where vertices are connected as described in the input {@link GraphConnection} instance. @param <

Creates a new {@link UndirectedMutableGraph} instance where vertices are connected as described in the input {@link GraphConnection} instance. @param

Returns the right node reference. @return the right node reference.

{@inheritDoc}

Selects an arbitrary source from the input Graph to calculate the spanning tree. @return the linked spanning tree algorithm builder

Returns the <i>order</i> of a Graph (the number of Vertices); <b>NOTE</b>: implementors have to take in consideration throwing a {@link GraphExceptio

Ensures the truth of an expression involving one or more parameters to the calling method. @param expression a boolean expression @param errorMessage

Returns all vertices which touch this vertex. <b>NOTE</b>: implementors have to take in consideration throwing a {@link GraphException} if an error o

Returns the total set of Edges in the graph. <b>NOTE</b>: implementors have to take in consideration throwing a {@link GraphException} if an error oc

Returns the <i>size</i> of a Graph (the number of Edges) <b>NOTE</b>: implementors have to take in consideration throwing a {@link GraphException} if

Checks if the input {@code Vertex} was already visited. @param vertex the input {@code Vertex} @return true if the input {@code Vertex} was already v

Creates a list of integer colors. @param colorNumber number of colors @return the list.

Graph m-coloring algorithm. This algorithm uses a brute-force backtracking procedure to find a graph color. @return The color - vertex association.

Creates a complete graph with nVertices @param nVertices number of vertices @param g graph

This method checks if all connected vertices have different colors. @param g @param coloredVertices

Sets the impl attribute of the AcyclicContract object

Description of the Method

Applies the classical Kosaraju's algorithm to find the strongly connected components. <p>Note: the runtime complexity is O(V + E) and this algorithm

Returns true if the vertex is contained into the graph <b>NOTE</b>: implementors have to take in consideration throwing a {@link GraphException} if a

Verifies input objects are equal. @param o1 the first argument to compare @param o2 the second argument to compare @return true, if the input argumen

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

Returns the identity value. @return the identity value

{@inheritDoc}

{@inheritDoc} <pre>FIB-HEAP-EXTRACT-MIN(H) 1 z &larr; min[H] 2 if z &ne; NIL 3 then for each child x of z 4 do add x to the root

Update the input vertex distance. @param vertex the vertex for which the distance has to be updated @param distance the new input vertex distance

Returns the color associated to the input vertex. @param v the vertex for which getting the color. @return the color associated to the input vertex.

Applies the <a href="https://en.wikipedia.org/wiki/Kruskal%27s_algorithm">Kruskal</a>'s algorithm. @param <WO> the type of weight operations @param w

{@inheritDoc}

Find the maximum flow on the input {@link Graph}. @param <V> The Graph vertices type @param <WE> the Graph edges type @param <G> The Graph type @para

Allows specify a source vertex to calculate the spanning tree. @param source the source vertex to calculate the spanning tree. @return the linked spa

Returns the number of required colors for coloring the Graph. @return the number of required colors for coloring the Graph.

Gets the weight of the {@code Weighted} object. @return the weight of the {@code Weighted} object.

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

Calculates the shortest path using bidirectional Dijkstra's algorithm. @param <WO> the type of weight operations @param weightOperations the class re

Calculates the shortest path using Dijkstra's algorithm. @param <WO> the type of weight operations @param weightOperations the class responsible for

{@inheritDoc}

Returns the reference to the first child node. @return the reference to the first child node.

{@inheritDoc}

Sets the left node reference. @param left the left node reference.

Sets the right node reference. @param left the right node reference.

Allows select a series of algorithms to apply on input graph. @param <V> The Graph vertices type @param <E> The Graph edges type @param <G> The Graph

Adds a feature to the Edge attribute of the Contract object

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

Applies the <a href="https://en.wikipedia.org/wiki/Bor%C5%AFvka's_algorithm">Boruvka</a>'s algorithm. @param <WO> the type of weight operations @para

Colors the graph such that no two adjacent vertices share the same color. @return The color - vertex association.

Find all connected Component for a specific graph. @return A collection of the disjointed sub-graphes

Calculates the input graph Connected Component. @param <V> The Graph vertices type. @param <E> The Graph edges type. @param <G> The directed graph ty

Returns the adapted element by this node. @return the adapted element by this node.

Returns the set of vertexs which lead away from the vertex. @param v the vertex which outbound vertexs have to be returned @return the set of vertexs

Applies the <a href="https://en.wikipedia.org/wiki/Reverse-Delete_algorithm">Reverse-Delete</a> algorithm. <pre> function ReverseDelete(edges[] E)

Build a {@link WeightedPath} instance related to source-target path. @param source the path source vertex @param target the path target vertex @retur

@param g @throws FileNotFoundException @throws IOException @throws ClassNotFoundException

Ensures the truth of an expression involving the state of the calling instance, but not involving any parameters to the calling method. @param expres

Returns the adjacency list where stored vertex/edges. @return the adjacency list where stored vertex/edges.

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

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

Add an edge in the predecessor list associated to the input vertex. @param tail the predecessor vertex @param head the edge that succeeds to the inpu

Calculates the shortest path using the A algorithm. @param <WO> the type of weight operations @param weightOperations the class responsible for opera

Calculates the maximum flow using the Ford-Fulkerson method. @param <WO> the type of weight operations @param weightOperations the class responsible

Returns the left node reference. @return the left node reference.

Returns the reference to the parent node, the node itself by default. @return the reference to the parent node, the node itself by default.

Computes a hashCode given the input objects. @param initialNonZeroOddNumber a non-zero, odd number used as the initial value. @param multiplierNonZer

{@inheritDoc}

@param heuristic @param <H> @return

Calculates the shortest path using the BellmannFord's algorithm. @param <WO> the type of weight operations @param weightOperations the weight operati

Applies the classical Cheriyan/Mehlhorn/Gabow's algorithm to find the strongly connected components, if exist. @return the input graph strongly conne

Applies the <a href="https://en.wikipedia.org/wiki/Prim%27s_algorithm">Prim</a>'s algorithm. @param <WO> the type of weight operations @param weightO

Tarjan's algorithm is a variation (slightly faster) on KosarajuSharir's algorithm for finding strongly-connected components in a directed graph. <p>N

Returns true if the edge is contained into the graph <b>NOTE</b>: implementors have to take in consideration throwing a {@link GraphException} if an