drum hamiltonian de cost minim
Last Updated: Mar 04 2015 19:44, Started by
cumva
, Mar 04 2015 18:22
·
0
#1
Posted 04 March 2015 - 18:22
Fiind dat un graf ( fara noduri izolate ) , cum pot afla drumul de cost minim ce uneste toate muchiile acestuia ? Drumul asta e pur si simplu n lant intre toate nodurile , si de aceea face inutila ( cel putin pentru mine ) aplicarea oricarui algoritm de drum minim in graf ( nu obtin nimic concludent ). Imi puteti da niste idei de algoritm ?
|
#2
Posted 04 March 2015 - 19:44
Anunturi
Bun venit pe Forumul Softpedia!
▶ 0 user(s) are reading this topic
0 members, 0 guests, 0 anonymous users