Package org.graph4j.realization

package org.graph4j.realization

Algorithms for graph realization problems.

Related Packages

Package	Description
org.graph4j	The main interfaces and classes for representing and using graphs.

Class	Description
BipartiteRealizationAlgorithm	The bipartite graph realization problem is to determine whether there exists a bipartite graph having a specified sequence of degrees for vertices in each partition set.
DigraphRealizationAlgorithm	The digraph realization problem is to determine whether there exists a directed graph having a specified sequence of in-degrees and out-degrees for each vertex.
GraphRealizationAlgorithm	The graph realization problem is to determine whether a given degree sequence can be represented by a simple, undirected graph.
HavelHakimiBipartiteRealization	This class provides a method to generate a bipartite graph from a given sequence of degrees, using an adaptation of the Havel-Hakimi algorithm.
HavelHakimiGraphRealization	This class provides a method to generate a graph from a given degree sequence, using the Havel-Hakimi algorithm.
KleitmanWangDigraphRealization	This class provides a method to generate a directed graph from a given sequence of in-degrees and out-degrees, using the Kleitman-Wang algorithm.