= Havel–Hakimi algorithm
{wiki=Havel–Hakimi_algorithm}
The Havel–Hakimi algorithm is a recursive algorithm used to determine whether a given degree sequence can represent the degree sequence of a simple, undirected graph. A degree sequence is a list of non-negative integers that represent the degrees (the number of edges incident to a vertex) of the vertices in a graph. \#\#\# Steps of the Havel–Hakimi Algorithm: 1. **Input**: A non-increasing sequence of non-negative integers, also known as the degree sequence.
Back to article page
