Al momento, stai seguendo questo contributo
- Vedrai gli aggiornamenti nel tuo feed del contenuto seguito
- Potresti ricevere delle email a seconda delle tue preferenze per le comunicazioni
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
Cita come
MOHAMMEDI RIDHA DJAMEL (2026). Prüfer's encoding and decoding (https://it.mathworks.com/matlabcentral/fileexchange/48108-prufer-s-encoding-and-decoding), MATLAB Central File Exchange. Recuperato .
Informazioni generali
- Versione 1.1.0.0 (1,74 KB)
Compatibilità della release di MATLAB
- Compatibile con qualsiasi release
Compatibilità della piattaforma
- Windows
- macOS
- Linux
