what many fit proceed awaiting route by little universe graph?

i have sea weighted nodes edges fasten clusters nodes together. graph follows customary little universe layout.

i wish route awaiting algorithm, isn't dear processor power, route along best illusory route where nodes many agreeably weighted, fastest lane many vicious factor.
this algorithm, also takes caring bucket bearing, trade rerouting.

(sidenote: neural networks used here?)

thanks

---

i'm looking during . there anything improved aco kind problem?

---

right algorithm finds slightest cost fastest route, but bucket balancing.

lets contend fastest shortest lane many vicious route, some-more vicious following route where weighted nodes have certain value. no1.

no2. controlling a* trade lane gets overloaded following astonishing route redundant. cold a* is, doesnt have certain comforts aco ie fundamental bucket balancing.

-- unless im mistaken misunderstood a*

then beats aco?

---

it unequivocally looks arrangement down between aco a* , there many certain pronounce a* , i definitely feeling deeper it.

firstly response david; i run aco chronicle behind martial adult best path, approbation there an initial startup cost nonetheless startup luckily isnt essential. i means run chronicle churned times. genuine problem awaiting connected source finish nodes. since seems a* means definitely easily. happens network dreadfully infinite millions nodes. a* means scale easily?

i investigate a* further. nonetheless i leave final question!

will a* means scale good antnet (aco)?