Cum e un graf in Haskell ?

From HaskellWiki
Revision as of 03:31, 26 April 2021 by Atravers (talk | contribs) (Still could use some more content, or be merged with other related (tiny) pages to form a larger document...)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search


Sistemul Haskell, deoarece foloseste lazy evaluation, permite folosirea in descrierile a tot ce doriti a unor elemente care nu sunt inca definite, dar le veti defini mai apoi in program. Astfel este usor de programat orice, inclusiv grafuri. Chiar daca, de exemplu, un vecin de pe lista de noduri nu este definit il puteti defini putin mai jos, in acelasi program.

Retrieved from "https://wiki.haskell.org/index.php?title=Cum_e_un_graf_in_Haskell_%3F&oldid=64360"