{@inheritDoc}

The degree (or valency) of a vertex of a {@link Graph} is the number of edges incident to the vertex. <b>NOTE</b>: implementors have to take in consi

Checks if there is a weight related to the input {@code Vertex}. @param vertex the input {@code Vertex} @return true if there is a weight for the inp

{@inheritDoc}

Find all the connected components included into the specified graph @return the connectivity algorithm selector.

{@inheritDoc}

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

Depth-first search algorithm implementation. @return the depth first search tree

Calculates the maximum flow using the Edmonds-Karp algorithm. @param <WO> the type of weight operations @param weightOperations the class responsible

{@inheritDoc}

{@inheritDoc}

Performs the @code{ find} operation by applying the <i>path compression</i>. @param node the input DisjointSet node for the @code{ find} operation @r

{@inheritDoc}

Checks if there is a shortest distance between source and target. @param source The source Vertex @param target The target Vertex @return Returns tru

Moves the target node in the {@code H} root nodes. @param node the node has to be moved in the {@code H} root nodes @see #add(Object) @see #consolida

Flags the current node as marked. @param marked the current node mark status.

@param source @param target @param distance

Adds a feature to the Vertex attribute of the Contract object

Just calculates the SCC depending on the selected algorithm. @param algorithm @return

Breadth-first search algorithm implementation. @return the breadth first search tree

Creates a graph that contains all classic sudoku contratints. @return

{@inheritDoc}

{@inheritDoc}

Export the graph in DOT or GraphML format. @param <V> The Graph vertices type @param <E> The Graph edges type @param <G> The Graph type @param graph

{@inheritDoc}

{@inheritDoc}

Returns the set of edges which are inbound to the vertex. @param v the vertex which inbound vertexs have to be returned @return the set of vertexs wh

Returns the {@code Map} of indexed edges. @return the {@link Map} of indexed edges

Returns the {@code Map} of indexed vertices. @return the indexed vertices {@link Map}

Retrieves the {@code DisjointSetNode} from the {@link #disjointSets}, if already previously set, creates a new one and push it in {@link #disjointSets

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

{@inheritDoc}

Returns the target of the path. @return the target of the path.

Returns the distance related to input vertex, or null if it does not exist. <b>NOTE</b>: the method {@link hasWeight} should be used first to check i

Specifies the set of vertices included into a connected component. @param vertices the set of vertices included into a connected component. @return t

Allows populate the given {@link MutableGraph}. @param <V> The Graph vertices type @param <E> The Graph edges type @param <G> The Graph type @param g

Searches a directed graph in iterative depth-first order, while adding the visited vertices in a recursive manner, i.e. a vertex is added to the resul

Returns a synchronized (thread-safe) {@link DirectedGraph} backed by the specified Graph. It is imperative that the user manually synchronize on the

Connects the graph. @param graphConnection the {@link GraphConnection} @return the {@link org.apache.commons.graph.Graph} built from the connections.

{@inheritDoc}

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

@param source @param target @param weightedPath

Applies the <i>h(x)</i> "heuristic estimate" of the distance from the start to the goal. @param current the current visited Vertex in the Graph. @par

Calculates all vertices shortest paths using the FloydWarshall's algorithm. @param <WO> the type of weight operations @param weightOperations the wei

A generalized graph search algorithm to be used to implement depth-first and breadth-first searches. Depending on the used collection, the algorithm t

Create a Biparted graph @param nVertices number of vertices @param g graph

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

Compare the given objects according to the specified comparator if not null, according to their natural ordering otherwise. @param o1 the first {@lin

{@inheritDoc}

{@inheritDoc}

Return the edge {@link Set} @return the edge {@link Set}

Performs a depth-first search to create a recursive vertex list. @param source the starting vertex @param visitedVertices a {@link Set} containing al

Returns the ranking for the player @param player the player @return Returns the ranking for the player

Checks whether there is an augmenting path in the flow network, given the current residual capacities. @return true if there is an augmenting path, f

Increase the path weight with the weight of the input weighted edge. @param edge the edge whose weight is used to increase the path weight

Performs the internal operations to add the edge @param head the head vertex @param e the edge @param tail the tail vertex

Performs the internal operations to remove the edge. @param head the head vertex @param e the edge @param tail the tail vertex

Returns the inverse of the input element. @param element the input element @return the inverse of the input element

{@inheritDoc}

Sets the reference to the first child node. @param child the reference to the first child node.

Returns the number of vertices degrees in the graph. @return the number of vertices degrees in the graph.

{@inheritDoc}

Updates the residual capacities in the flow network, based on the most recent augmenting path.

Export Graphs in <a href="https://graphml.graphdrawing.org/">GraphML file format</a>. @return {@link GraphMLExporter} instance @throws GraphExportExc

Use the given name when exporting the {@link org.apache.commons.graph.Graph} to a resource. @param name the name to identify the {@link org.apache.co

@param e