Kontentga o’tish

WALKER

Dasturchi, frilanser, gik va introvert

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

Kalit so'z: flow

Posted on Noyabr 30, 2020Dekabr 1, 2020

Digraph’da minimum cut va maximum flow masalalari

Graph processing masalalarini o’rganishni davom ettiramiz. Minimum cut – graph’ni ikkiga shunday bo’lish kerakki, uning bo’linish edge’lari bir-biriga eng kam (kuchsiz) bog’langan joyi bo’lsin. Oddiyroq aytganda, graph’ni ikkiga bo’lish uchun eng kam harajat / kuch talab etilsin.

Twitterdan

Kuzatib boring