The Havel-Hakimi algorithm determines whether a given degree sequence is graphical or not, i.e., whether a simple graph can be constructed from the values.
-
Updated
Apr 30, 2022 - Java
#
havel-hakimi-algorithm
Here are 2 public repositories matching this topic...
DFS, BFS and Haval-hakimi : implementation with Java (Graphic)
-
Updated
Jan 26, 2019 - Java
Improve this page
Add a description, image, and links to the havel-hakimi-algorithm topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the havel-hakimi-algorithm topic, visit your repo's landing page and select "manage topics."