A simple code for Prüfer's encoding and decoding.
In combinatorial mathematics, the Prüfer sequence (also Prüfer code or Prüfer numbers) of a labeled tree is a unique sequence associated with the tree. The sequence for a tree on n vertices has length n − 2, and can be generated by a simple iterative algorithm. Prüfer sequences were first used by Heinz Prüfer to prove Cayley's formula in 1918.
For more informations see:
http://en.wikipedia.org/wiki/Pr%C3%BCfer_sequence
Cite As
MOHAMMEDI RIDHA DJAMEL (2024). Prüfer's encoding and decoding (https://www.mathworks.com/matlabcentral/fileexchange/48108-prufer-s-encoding-and-decoding), MATLAB Central File Exchange. Retrieved .
MATLAB Release Compatibility
Platform Compatibility
Windows macOS LinuxCategories
Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!Discover Live Editor
Create scripts with code, output, and formatted text in a single executable document.