Kontentga o’tish

WALKER

Dasturchi, frilanser, gik va introvert

  • Faoliyat
  • Frilans
  • Algoritmlar
  • Sayohat
  • Islom
  • Munosabat
  • Betartib
  • Muallif

Kalit so'z: acyclic shortest path

Posted on Noyabr 26, 2020Noyabr 29, 2020

Weight’ga ega DAGlarda shortest path’ni topish

Graph

Endi biz DAGlar (directed acyclic graph) uchun shortest path’ni topishni ko’rib chiqamiz. Aslida DAGlar uchun Dijkstra’ning algoritmi ham ishlayveradi, ammo bizdagi graph’ning acyclic, ya’ni aylanasi yo’q ekanligini bilar ekanmiz, bu bizga shortest path’ni topish ishini yengillashtiradimi?

Twitterdan

Kuzatib boring