Uses of Package
org.graph4j.coloring
Packages that use org.graph4j.coloring
Package
Description
Algorithms for the bandwith graph coloring problem.
Algorithms for the equitable graph coloring problem.
Support algorithms for various type of graphs (bipartite, tournament, etc.).
-
Classes in org.graph4j.coloring used by org.graph4j.coloringClassDescriptionAttempts at finding the optimum coloring of a graph using a systematic exploration of the search space.Attempts at finding the optimum coloring of a graph using a systematic exploration of the search space.A coloring of the vertices of a graph.Base class for exact vertex coloring algorithms.Greedy coloring is a simple heuristic algorithm that assigns colors to the vertices of a graph in a greedy manner, that is, by selecting the smallest possible color that has not yet been used by any of the neighboring vertices.A node in the backtrack coloring search tree.
-
Classes in org.graph4j.coloring used by org.graph4j.coloring.bwClassDescriptionAttempts at finding the optimum coloring of a graph using a systematic exploration of the search space.A coloring of the vertices of a graph.Base class for exact vertex coloring algorithms.Greedy coloring is a simple heuristic algorithm that assigns colors to the vertices of a graph in a greedy manner, that is, by selecting the smallest possible color that has not yet been used by any of the neighboring vertices.A node in the backtrack coloring search tree.
-
Classes in org.graph4j.coloring used by org.graph4j.coloring.eqClassDescriptionAttempts at finding the optimum coloring of a graph using a systematic exploration of the search space.A coloring of the vertices of a graph.Base class for exact vertex coloring algorithms.A node in the backtrack coloring search tree.
-
Classes in org.graph4j.coloring used by org.graph4j.support