Salut, am nevoie sa invat si prezint macar unul din urmatori algoritmi :
- Steiner trees The Kou-Markowsky-Berman algorithm
- Minimum weight spanning arborescences -> Counting spanning arborescences
- Edmonds’ algorithm
- Maximum matchings -> The Berge-Norman-Rabin theorem
- Edmonds’ algorithm
- NP-hard problems in Graph Theory -> Maximum clique problem
- NP-hard problems in Graph Theory-> Maximum stable set problem
- NP-hard problems in Graph Theory -> Minimum (cardinality) transversal problem
- NP-hard problems in Graph Theory-> Minimum Steiner Tree problem
- Models of mathematical programming Constructing the geometric dual
- Duality theorems
- Models of mathematical programming Constructing the geometric dual
- The linear programming case
Exista algoritmi astia cel mai probabil in c++ poate chiar si in java insa m-ar interesa in javascript in mod deosebit pentru ca vreau sa combin utilul cu placutul.
Nici in Pyhon nu ar fi rau sa fie , dar in js e mai mult decat perfect.
Ca si alternativa, punct de plecare am luat stack overflow la mana si … aceasta carte :
https://www.amazon.com/Learning-JavaScript-Data-Structures-Algorithms/dp/1783554878 nu am gasit ce imi trebuie din pacate…