TOPOLOGIK TARTIBLASH: KAHN ALGORITMINING TEZKOR YONDASHUVI
Keywords:
Kalit so’zlar: Topologik tartiblash, Kahn algoritmi, Tezkor yondashuv, Direkt graf, Tsiklsiz graf, Vaqt kompleksligi, Algoritm optimallashtirish, Parallel hisoblash, Graflar, Dasturiy ta’minot, Tizimlar nazariyasi, Amaliy qo‘llanilish, Yirik graf, Tezkor algoritmlarAbstract
Annotatsiya: Maqolada, "Topologik Tartiblash: Kahn algoritmining tezkor yondashuvi", topologik tartiblash masalasini yechishda Kahn algoritmining samarali qo‘llanilishi va uning tezkor yondashuvi muhokama qilinadi. Kahn algoritmi, yo‘llar orasidagi bog‘lanishlar (direkt grafda) orqali tsikl mavjud bo‘lmagan elementlarning tartiblanishini ta’minlashga mo‘ljallangan bo‘lib, u O(n + m) vaqt kompleksligi bilan ishlaydi, bu yerda n — tugunlar soni, m — qirralar soni. Maqola, Kahn algoritmiga asoslangan yondashuvning samaradorligini tahlil qiladi, ayniqsa yirik va murakkab graflarda.
References
1. Kahn, A. B. (1962). "Topological sorting of large networks". Communications of the ACM, 5(11), 558-562.
2. Sedgewick, R., & Wayne, K. (2011). Algorithms (4th ed.). Addison-Wesley.
3. Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C. (2009). Introduction to Algorithms (3rd ed.). MIT Press.
4. Knuth, D. E. (1997). The Art of Computer Programming, Volume 1: Fundamental Algorithms (3rd ed.). Addison-Wesley.
5. Shen, H., & Wang, J. (2013). Graph Theory and Complex Networks: An Introduction. Springer.
6. Microsoft Documentation (2023). C# Programming Guide.
