Abstract class used for test coloring.

TODO fill me!! @param <V> The Graph vertices type @param <E> The Graph edges type

Description of the Interface

Description of the Class

Description of the Class

Represents all shortest paths between all vertex pairs calculated by {@link FloydWarshall} algorithm. @param <V> The Graph vertices type @param <WE>

Code partially extracted from Google Collections

Basic abstract in-memory based of a simple read-only {@link Graph} implementation. Subclasses may load adjacency list/edges set in the constructor, or

Base NOOP {@link GraphVisitHandler} implementation. @param <V> The Graph vertices type @param <E> The Graph edges type

Basic abstract in-memory based of a simple mutable {@link org.apache.commons.graph.Graph} implementation. This class is NOT thread safe! @param <V>

The class {@link BigDecimalWeightBaseOperations} provides operations and properties for weights of type {@link BigDecimal}.

The class {@link BigIntegerWeightBaseOperations} provides operations and properties for weights of type {@link BigInteger}.

A category is used for classification of players.

Applies the classical Cheriyan/Mehlhorn/Gabow's algorithm to find the strongly connected components, if exist. @param <V> The Graph vertices type. @p

Test for Tarjan's algorithm implementation, see the <a href="http://scienceblogs.com/goodmath/2007/10/computing_strongly_connected_c.php">online</a> t

Maintains the color for each vertex and the required number of colors for {@link org.apache.commons.graph.Graph} coloring. @param <V> The Graph verti

Builder for selecting the coloring algorithm to perform. @param <V> The Graph vertices type @param <E> The Graph edges type @param <C> The Color vert

Builder to specify the set of colors for coloring the graph. @param <V> The Graph vertices type @param <E> The Graph edges type

The Apache Commons Graph package is a toolkit for managing graphs and graph based data structures.

Builder for selecting the connectivity algorithm to perform. @param <V> The Graph vertices type @param <E> The Graph edges type

Builder to specify the set of vertices included into a connected component. @param <V> The Graph vertices type @param <E> The Graph edges type

Description of the Interface @param <V> The Graph vertices type @param <E> The Graph edges type

Description of the Class

Description of the Class

{@link ColoringAlgorithmsSelector} implementation. @param <V> The Graph vertices type @param <E> The Graph edges type @param <C> The Color vertices t

{@link ColorsBuilder} implementation @param <V> The Graph vertices type @param <E> The Graph edges type

TODO Fill me!! @param <V> The Graph vertices type @param <E> The Graph edges type

TODO Fill me!! @param <V> The Graph vertices type @param <E> The Graph edges type

{@link NamedExportSelector} implementation @param <V> The Graph vertices type. @param <E> The Graph edges type.

{@link FlowWeightedEdgesBuilder} implementation @param <V> The Graph vertices type @param <WE> the Graph edges type

{@link FromHeadBuilder} implementation. @param <V> The Graph vertices type @param <WE> the Graph edges type @param <W> The Graph weight type

TODO Fillme!! @param <V> The Graph vertices type @param <E> The Graph edges type @param <G> The Graph type

{@link MaxFlowAlgorithmSelector} implementation. @param <V> The Graph vertices type @param <WE> the Graph edges type @param <W> The Graph weight type

TODO Fill me!! @param <P> The player's type

{@link SccAlgorithmSelector} implementation @param <V> The Graph vertices type. @param <E> The Graph edges type.

{@link SpanningTreeAlgorithmSelector} implementation. @param <V> The Graph vertices type @param <W> The weight type @param <WE> the Graph weighted ed

{@link SpanningTreeSourceSelector} implementation. @param <V> The Graph vertices type @param <W> The weight type @param <WE> the Graph weighted edges

{@link DefaultToTailBuilder} implementation. @param <V> The Graph vertices type @param <WE> the Graph edges type @param <W> The Graph weight type

{@link VisitAlgorithmsSelector} implementation. @param <V> The Graph vertices type @param <E> The Graph edges type @param <G> The Graph type

{@link VisitSourceSelector} implementation. @param <V> The Graph vertices type @param <E> The Graph edges type @param <G> The Graph type

Description of the Class

A {@code DirectedGraph} or <i>digraph</i> is an ordered pair {@code D = ( V, E )} with <ul> {@code V} a set whose elements are called vertices or node

A memory-based implementation of a mutable directed Graph. This class is NOT thread safe! @param <V> The Graph vertices type @param <E> The Graph ed

Simple <a href="https://en.wikipedia.org/wiki/Disjoint-set_data_structure">Disjoint-set</a> implementation. @param <E> The type of elements held in t

The {@link DisjointSet} internal node representation. @param <E> The type of elements held in this node

This class is NOT thread-safe! @param <V> @param <E>

The class {@link DoubleWeightBaseOperations} provides operations and properties for weights of type {@link Double}.

Test for Edmonds-Karp algorithm implementation. The test graph is available on <a href="http://en.wikipedia.org/wiki/Edmonds%E2%80%93Karp_algorithm#Ex

Sample taken from <a href="http://www.teamliquid.net/forum/viewmessage.php?topic_id=253017">teamliquid</a>

Allows users selecting the format of graph serialization. @param <V> The Graph vertices type. @param <E> The Graph edges type.

A Fibonacci Heap implementation based on <a href="https://staff.ustc.edu.cn/~csli/graduate/algorithms/book6/chap21.htm">University of Science and Tech

The {@link FibonacciHeap} node reference. @param <E> The type of elements held in the {@link FibonacciHeap} collection.

The {@link FibonacciHeap} test case taking inspiration from <a href="http://langrsoft.com/jeff/2011/11/test-driving-a-heap-based-priority-queue/">Test

The class {@link FloatWeightBaseOperations} provides operations and properties for weights of type {@link Float}.

Provides standard operations for max-flow algorithms, like Ford-Fulkerson or Edmonds-Karp. @param <V> The vertex type @param <W> The weight type

TODO Fill Me! @param <V> The Graph vertices type @param <WE> the Graph edges type

Test for Ford-Fulkerson algorithm implementation. The test graph is available on <a href="http://en.wikipedia.org/wiki/Ford%E2%80%93Fulkerson_algorith

TODO Fill me!!! @param <V> The Graph vertices type @param <WE> the Graph edges type @param <W> The Graph weight type

The possible results of a game.

A Graph data structure consists of a finite (and possibly mutable) set of ordered pairs, called edges or arcs, of certain entities called vertex or no

TODO Fillme!!! @param <V> The Graph vertices type @param <E> The Graph edges type

TODO Fillme!! @param <V> The Graph vertices type @param <E> The Graph edges type

GraphException This is the superclass of all exceptions that can be thrown.

{@link GraphExportException} throws when some errors occurs during the graph export.